Computer Science – Computational Geometry
Scientific paper
2010-11-25
Computer Science
Computational Geometry
18 pages, 6 figures
Scientific paper
We study the properties of affine rigidity of a hypergraph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., depends only on the hypergraph, not the particular embedding). Then we prove that a graph is generically neighborhood affinely rigid in d-dimensional space if it is (d+1)-vertex-connected. We also show neighborhood affine rigidity of a graph implies universal rigidity of its squared graph. Our results, and affine rigidity more generally, have natural applications in point registration and localization, as well as connections to manifold learning.
Gortler Steven J.
Gotsman Craig
Liu Ligang
Thurston Dylan P.
No associations
LandOfFree
On affine rigidity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On affine rigidity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On affine rigidity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-587435