Manifold reconstruction using tangential Delaunay complexes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 324-333

  Boissonnat, Jean Daniel ^a   Ghosh, Arijit ^a  

^a INRIA   (France)

Author keywords

Manifold learning; Manifold reconstruction; Sampling conditions; Sliver exudation; Tangential delaunay complex; Weighted delaunay triangulation

Indexed keywords

DELAUNAY; DELAUNAY TRIANGULATION; MANIFOLD LEARNING; MANIFOLD RECONSTRUCTION; SAMPLING CONDITIONS;

APPROXIMATION ALGORITHMS; REPAIR; TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 77954923302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1811013     Document Type: Conference Paper

References (31)

1. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Intl. Journal of Computational Geometry and Application, 12:125-141, 2002.
2. F. Aurenhammer. Power diagrams: properties, algorithms and applications. SIAM J. Comput., 16(1), 1987.
3. F. Aurenhammer and H. Edelsbrunner. An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognition, 17(2):251-257, 1984.
4. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, 2001.
5. M. Belkin, J. Sun, and Y. Wang. Discrete laplace operator on meshed surfaces. In Proc. ACM Symp. on Computational Geometry, 2008.
6. J.-D. Boissonnat and J. Flötotto. A coordinate system associated with points scattered on a surface. Computer-Aided Design, 36:161-174, 2004.
7. J.-D. Boissonnat and A. Ghosh. Manifold Reconstruction using Tangential Delaunay Complexes. INRIA Research Report 7142, 2009.
8. J. D. Boissonnat, L. Guibas, and S. Y. Oudot. Manifold reconstruction in arbitary dimensions using witness complexes. In Proc. ACM Symp. on Computational Geometry, pages 193-204, 2007.
9. J.-D. Boissonnat, C. Wormser, and M. Yvinec. Locally uniform anisotropic meshing. In Proc. ACM Symp. on Computational Geometry, pages 270-277, 2008.
10. F. Cazals and J. Giesen. Delaunay triangulation based surface reconstruction. In J. Boissonnat and M. Teillaud, editors, Effective Computational Geometry for Curve and Surfaces. Springer, 2006.
11. F. Chazal and A. Lieutier. Smooth Manifold Reconstruction from Noisy and Non uniform Approximation with Guarantees. Comp. Geom: Theory and Applications, 40:156-170, 2008.
12. F. Chazal and S. Y. Oudot. Towards Persistence-Based Reconstruction in Euclidean Spaces. In Proc. ACM Symp. on Computational Geometry, pages 232-241, 2008.
13. S.-W. Cheng, T. K. Dey, H. Edelsbrunner, M. A. Facello, and S.-H. Teng. Sliver Exudation. Journal of ACM, 47:883-904, 2000.
14. S.-W. Cheng, T. K. Dey, and E. A. Ramos. Manifold Reconstruction from Point Samples. In Proc. ACM-SIAM Symp. Discrete Algorithms, pages 1018-1027, 2005.
15. S.-W. Cheng, Y. Wang, and Z. Wu. Provable Dimension Detection using Principle Component Analysis. Intl. Journal of Computational Geometry and Application, 18(5):415-440, 2008.
16. D. Cohen-Steiner and T. K. F. Da. A greedy Delaunay Based Surface Reconstruction Algorithm. The Visual Computer, 20:4-16, 2004.
17. T. K. Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, 2006.
18. D. L. Donohu and C. Grimes. Hessian eigenmaps: new locally linear embedding techniques for high dimensional data. Proceedings of the Natural Academy of Sciences, 100:5591-5596, 2003.
19. J. Flötotto. A coordinate system associated to a point cloud issued from a manifold: definition, properties and applications. PhD thesis, Université of Nice Sophia-Antipolis, 2003.
20. D. Freedman. Efficient simplicial reconstructions of manifolds from their samples. IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(10), 2002.
21. S. Funke and E. Ramos. Smooth-surface reconstruction in near-linear time. In Proc. ACM-SIAM Symp. Discrete Algorithms, pages 781-780, 2002.
22. J. Giesen and U. Wagner. Shape dimension and intrinsic metric from samples of manifolds. In Proc. ACM Symp. on Computational Geometry, pages 329-337, 2003.
23. M. Gopi, S. Khrisnan, and C. T. Silva. Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation. Eurographics, 19 (3), 2000.
24. S. Lafon and A. B. Lee. Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameterization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:1393-1403, 2006.
25. B. Nadler, S. Lafon, R. R. Coifman, and I. G. Kevrekidis. Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators. Neural Information Processing Systems, 18, 2005.
26. P. Niyogi, S. Smale, and S. Weinberger. Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete and Computational Geometry, 39(1-3), March 2008.
27. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000.
28. H. S. Seung and D. D. lee. The manifold ways of perception. Science, 290:2268-2269, 2000.
29. J. Shewchuk. Star splaying: An algorithm for repairing delaunay triangulations and convex hulls. In Proc. ACM Symp. on Computational Geometry, pages 237-246, 2005.
30. J. B. Tenenbaum, V. deSilva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
31. Z. Zhang and H. Zha. Principal manifolds and nonlinear dimension reduction via local tangent space alignment. SIAM Journal of Scientific Computing, 26(1):313-338, 2004.