Cut locus and topology from surface point data

A cut locus of a point p in a compact Riemannian manifold M is defined as the set of points where minimizing geodesics issued from p stop being minimizing. It is known that a cut locus contains most of the topological information of M. Our goal is to utilize this property of cut loci to decipher the topology of M from a point sample. Recently it has been shown that Rips complexes can be built from a point sample P of M systematically to compute the Betti numbers, the rank of the homology groups of M. Rips complexes can be computed easily and therefore are favored over others such as restricted Delaunay, alpha, Cech, and witness complex. However, the sizes of the Rips complexes tend to be large. Since the dimension of a cut locus is lower than that of the manifold M, a subsample of P approximating the cut locus is usually much smaller in size and hence admits a relatively smaller Rips complex. In this paper we explore the above approach for point data sampled from surfaces embedded in any high dimensional Euclidean space. We present an algorithm that computes a subsample P' of a sample P of a 2-manifold where P' approximates a cut locus. Empirical results show that the first Betti number of M can be computed from the Rips complexes built on these subsamples. The sizes of these Rips complexes are much smaller than the one built on the original sample of M.

[1]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[2]  Earl J. Mickle On a decompostion theorem of Federer , 1959 .

[3]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[4]  Leonidas J. Guibas,et al.  Geodesic Delaunay triangulation and witness complex in the plane , 2008, SODA '08.

[5]  I. Hassan Embedded , 2005, The Cyber Security Handbook.

[6]  Tamal K. Dey,et al.  Manifold reconstruction from point samples , 2005, SODA '05.

[7]  Frédéric Chazal,et al.  Topology guaranteeing manifold reconstruction using distance function to noisy data , 2006, SCG '06.

[8]  S. Myers,et al.  Connections between differential geometry and topology II. Closed surfaces , 1936 .

[9]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[10]  Leonidas J. Guibas,et al.  Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes , 2007, SCG '07.

[11]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

[12]  Tamal K. Dey,et al.  Topology from Data via Geodesic Complexes∗ , 2022 .

[13]  F. Chazal,et al.  The λ-medial axis , 2005 .

[14]  Michael A. Buchner,et al.  Simplicial structure of the real analytic cut locus , 1977 .

[15]  Steve Oudot,et al.  Towards persistence-based reconstruction in euclidean spaces , 2007, SCG '08.

[16]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  I. Jolliffe Principal Component Analysis , 2002 .

[18]  I. Holopainen Riemannian Geometry , 1927, Nature.

[19]  Erin W. Chambers,et al.  Testing contractibility in planar rips complexes , 2008, SCG '08.

[20]  I. Chavel Riemannian Geometry: Subject Index , 2006 .

[21]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA '06.

[22]  Stephen Smale,et al.  Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..

[23]  Gunnar E. Carlsson,et al.  Topological estimation using witness complexes , 2004, PBG.

[24]  S. Myers,et al.  Connections between differential geometry and topology. I. Simply connected surfaces , 1935 .

[25]  Mikhail Belkin,et al.  Towards a theoretical foundation for Laplacian-based manifold methods , 2005, J. Comput. Syst. Sci..

[26]  K. Polthier,et al.  On the convergence of metric and geometric properties of polyhedral surfaces , 2007 .

[27]  Heng Tao Shen,et al.  Principal Component Analysis , 2009, Encyclopedia of Biometrics.