Manifold reconstruction in arbitrary dimensions using witness complexes

Discrete and Computational Geometry

Volumn 42, Issue 1, 2009, Pages 37-70

  Boissonnat, Jean Daniel ^a   Guibas, Leonidas J ^b   Oudot, Steve Y ^b  

^a INRIA   (France)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Manifold; Reconstruction; Restricted Delaunay triangulation; Weighted Delaunay triangulation; Witness complex

Indexed keywords

EID: 67349141554     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9175-1     Document Type: Article

References (35)

1. N. Amenta M. Bern 1999 Surface reconstruction by Voronoi filtering Discrete Comput. Geom. 22 4 481 504
2. N. Amenta M. Bern D. Eppstein 1998 The crust and the β-skeleton: combinatorial curve reconstruction Graph. Models Image Process. 60 125 135 (Pubitemid 128458198)
3. N. Amenta S. Choi T.K. Dey N. Leekha 2002 A simple algorithm for homeomorphic surface reconstruction Int. J. Comput. Geom. Appl. 12 125 141
4. Attali, D., Edelsbrunner, H., Harer, J., Mileyko, Y.: Alpha-beta witness complexes. In: Proc. 10th Workshop on Algorithms and Data Structures, pp. 386-397 (2007)
5. Attali, D., Edelsbrunner, H., Mileyko, Y.: Weak witnesses for Delaunay triangulations of submanifolds. In: Proc. ACM Sympos. on Solid and Physical Modeling, pp. 143-150 (2007) (Pubitemid 47582479)
6. M. Belkin P. Niyogi 2004 Semi-supervised learning on Riemannian manifolds Mach. Learn. 56 1-3 209 239
7. Boissonnat, J.-D., Oudot, S.: Provably good sampling and meshing of Lipschitz surfaces. In: Proc. 22nd Annu. Sympos. Comput. Geom., pp. 337-346 (2006) (Pubitemid 44300804)
8. Cazals, F., Giesen, J.: Delaunay triangulation based surface reconstruction. In: Boissonnat, J.D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces, pp. 231-273. Springer, Berlin (2006)
9. n from noisy data samples. In: Proc. 21st Annual ACM Symposium on Computational Geometry, pp. 255-262 (2005) (Pubitemid 43283468)
10. Chazal, F., Lieutier, A.: Topology guaranteeing manifold reconstruction using distance function to noisy data. In: Proc. 22nd Annu. Sympos. on Comput. Geom., pp. 112-118 (2006) (Pubitemid 44300778)
11. Chazal, F., Oudot, S.Y.: Towards persistence-based reconstruction in Euclidean spaces. In: Proc. 24th ACM Sympos. Comput. Geom., pp. 232-241 (2008)
12. Chazal, F., Cohen-Steiner, D., Lieutier, A.: A sampling theory for compact sets in Euclidean space. In: Proc. 22nd Annu. Sympos. Comput. Geom., pp. 319-326 (2006) (Pubitemid 44300802)
13. S.-W. Cheng T.K. Dey H. Edelsbrunner M.A. Facello S.-H. Teng 2000 Sliver exudation J. Assoc. Comput. Mach. 47 5 883 904
14. Cheng, S.-W., Dey, T.K., Ramos, E.A.: Manifold reconstruction from point samples. In: Proc. 16th Sympos. Discrete Algorithms, pp. 1018-1027 (2005)
15. Cheng, S.-W., Dey, T.K., Ramos, E.A.: Manifold reconstruction from point samples. Journal version of [14]
16. Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. In: Proc. 21st ACM Sympos. Comput. Geom., pp. 263-271 (2005) (Pubitemid 43283469)
17. V. de Silva 2008 A weak characterisation of the Delaunay triangulation Geom. Dedic. 135 1 39 64
18. de Silva, V., Carlsson, G.: Topological estimation using witness complexes. In: Proc. Sympos. Point-Based Graphics, pp. 157-166 (2004)
19. D. DeMers G. Cottrell 1993 Nonlinear dimensionality reduction Adv. Neural Inf. Process. Syst. 5 580 587
20. Dey, T.K., Kumar, P.: A simple provable algorithm for curve reconstruction. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 893-894 (1999)
21. T.K. Dey J. Giesen S. Goswami W. Zhao 2003 Shape dimension and approximation from samples Discrete Comput. Geom. 29 419 434 (Pubitemid 36820397)
22. Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol. 10. Springer, Berlin (1987)
23. H. Edelsbrunner D. Letscher A. Zomorodian 2002 Topological persistence and simplification Discrete Comput. Geom. 28 511 533 (Pubitemid 36161396)
24. H. Federer 1959 Curvature measures Trans. Am. Math. Soc. 93 418 491
25. Gao, J., Guibas, L.J., Oudot, S.Y., Wang, Y.: Geodesic Delaunay triangulation and witness complex in the plane. In: Proc. 18th ACM-SIAM Sympos. on Discrete Algorithms, pp. 571-580 (2008)
26. J. Giesen U. Wagner 2004 Shape dimension and intrinsic metric from samples of manifolds with high co-dimension Discrete Comput. Geom. 32 245 267
27. L.J. Guibas S.Y. Oudot 2008 Reconstruction using witness complexes Discrete Comput. Geom. 40 325 356
28. A.B. Lee K.S. Pederson D. Mumford 2003 The nonlinear statistics of high-contrast patches in natural images Int. J. Comput. Vis. 54 1-3 83 103
29. X.-Y. Li 2003 Generating well-shaped d-dimensional Delaunay meshes Theor. Comput. Sci. 296 1 145 165
30. P. Niyogi S. Smale S. Weinberger 2008 Finding the homology of submanifolds with high confidence from random samples Discrete Comput. Geom. 39 1-3 419 441
31. S.T. Roweis L.K. Saul 2000 Nonlinear dimensionality reduction by locally linear embedding Science 290 5500 2323 2326 (Pubitemid 32041578)
32. Seow, M.-J., Tompkins, R.C., Asari, V.K.: A new nonlinear dimensionality reduction technique for pose and lighting invariant face recognition. In: Proc. IEEE Conf. on Computer Vision and Pattern Recognition-Workshops, p. 160 (2005)
33. J.B. Tenenbaum V. de Silva J.C. Langford 2000 A global geometric framework for nonlinear dimensionality reduction Science 290 5500 2319 2323 (Pubitemid 32041577)
34. Vlachos, M., Domeniconi, C., Gunopulos, D., Kollios, G., Koudas, N.: Non-linear dimensionality reduction techniques for classification and visualization. In: Proc. 8th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, pp. 645-651 (2002)
35. A. Zomorodian G. Carlsson 2005 Computing persistent homology Discrete Comput. Geom. 33 2 249 274 (Pubitemid 40176437)