Tamal K. Dey
ABSTRACT
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.
- . Belkin, P. Niyogi.Towards a Theoretical Foundation for Laplacian Based Manifold Methods. J. Comput. System Sci., to appear. Google Scholar
Digital Library
- M. Bernstein, V. de Silva, J. Langford, and J. Tenenbaum. Graphapproximations to geodesics on embedded manifolds. Tech Report,Dept. Psychology, Stanford University, USA, 2000.Available at http://isomap.stanford.edu/BdSLT.pdfGoogle Scholar
- .-D. Boissonnat, L. J. Guibas, and S. Y. Oudot.Manifold reconstruction in arbitrary dimensions usingwitness complexes. Proc. 23rd Ann. Sympos. Comput. Geom.(2007), 194--203. Google ScholarDigital Library
- . A. Buchner. Simplicial structure of the realanalytic cut locus. Proc. American Math. Soc. 64 (1977), 118--121.Google ScholarCross Ref
- . Chazal and A. Lieutier. Topology guaranteeingmanifold reconstruction using distance function to noisy data. Proc. 22nd Ann. Sympos. Comput. Geom. (2006), 112--118. Google ScholarDigital Library
- . Chazal and A. Lieutier. The lambda-medial axis. Graphical Models 67 (2006), 304--331. Google ScholarDigital Library
- . Chazal and S. Oudot. Towards persistence-based reconstruction in Euclidean spaces. Proc. 24th Ann. Sympos.Comput. Geom. (2008), 232--241. Google ScholarDigital Library
- . W. Chambers, J. Erickson,and P. Worah. Testing contractibility in planar Rips complexes Proc. 24th Ann. ACM Sympos. Comput. Geom. (2008), 251--259. Google ScholarDigital Library
- . Chavel. Riemannian Geometry: A ModernIntroduction. Cambridge U. Press, New York, 1994.Google Scholar
- .-W. Cheng, T. K. Dey, and E. A. Ramos.Manifold reconstruction from point samples. Proc. 16th Sympos. Discrete Algorithms (2005), 1018--1027. Google ScholarDigital Library
- . Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete Comput. Geom. 37 (2007), 103--120. Google ScholarDigital Library
- E. Colin de Verdière and J. Erickson.Tightening non-simple paths and cycles on surfaces. Proc. ACM-SIAM Sympos. Discrete Algorithms (2006), 192--201. Google ScholarDigital Library
- . K. Dey and K. Li. Topology from data via geodesic complexes. Tech report OSU-CISRC-3/09-TR05, 2009.Google Scholar
- . P. do Carmo. Riemannian geometry. Birkhauser, Boston, 1992.Google ScholarCross Ref
- . Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511--533.Google Scholar
- . Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. Proc. ACM-SIAM Sympos. Discrete Algorithms (2005), 1038--1046. Google ScholarDigital Library
- . Federer. Curvature measures. Trans. Amer. Math. Soc. 93 (1959), 418.Google ScholarCross Ref
- . Gao, L. J. Guibas, S. Y. Oudot, and Y. Wang. Geodesic Delaunay triangulations and witness complexes in the plane. Proc. ACM-SIAM Sympos. Discrete Algorithms (2008), 571--580. Google ScholarDigital Library
- . Hildebrandt, K. Polthier, and M. Wardetzky.On the convergence of metric and geometric properties of polyhedral surfaces. Geometriae Dedicata 123 (2006), 89--112.Google Scholar
- . T. Jollife. Principal Component Analysis.Springer series in statistics, Springer, NY, 2002.Google Scholar
- . P. A. Klingenberg. Riemannian Geometry.Walter de Gruyter, Berlin, 1995.Google Scholar
- . B. Myers. Connections between differential geometryand topology I: Simply connected surfaces. Duke Math. J. 1 (1935), 376--391.Google ScholarCross Ref
- . B. Myers. Connections between differential geometry and topology II: Closed surfaces. Duke Math. J. 2 (1936), 95--102.Google ScholarCross Ref
- P. Niyogi, S. Smale, and S. Weinberger.Finding the homology of submanifolds withhigh confidence from random samples. Discrete Comput. Geom. (2006). Google ScholarDigital Library
- . de Silva and G. Carlsson. Topological estimation using witness complexes. Proc. Sympos. Point-Based Graph.(2004), 157--166. Google ScholarDigital Library
- . B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science 290 (2000).Google Scholar
- . Zomorodian and G. Carlsson. Computing persistent homology. Discr. Comput. Geom. 33 (2005), 249--274. Google ScholarDigital Library
Index Terms
- Cut locus and topology from surface point data
Recommendations
Vietoris---Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space $\mathbb{E}^{n}$ , thought of as a point-cloud sampling of a certain domain $D\subset\mathbb{E}^{n}$ . The Vietoris---Rips complex is a combinatorial simplicial complex based on proximity of neighbors that ...
Cut locus realizations on convex polyhedra
AbstractWe prove that every positively weighted tree T can be realized as the cut locus C ( x ) of a point x on a convex polyhedron P, with T edge weights matching C ( x ) edge lengths. If T has n leaves, P has (in general) n + 1 vertices. We ...
A Counter-Example to Hausmann’s Conjecture
AbstractIn 1995 Jean-Claude Hausmann proved that a compact Riemannian manifold X is homotopy equivalent to its Rips complex for small values of parameter r. He then conjectured that the connectivity of Rips complexes is a monotone function in r, ...
Comments