Manifold reconstruction from point samples

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 1018-1027

  Cheng, Siu Wing ^a   Dey, Tamal K ^b   Ramos, Edgar A ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Ohio State University   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GEOMETRY; MATHEMATICAL MODELS; NONLINEAR EQUATIONS; PERTURBATION TECHNIQUES; PRINCIPAL COMPONENT ANALYSIS; PROBLEM SOLVING;

EUCLIDEAN SPACE; MANIFOLD LEARNING; MANIFOLD RECONSTRUCTION; MULTIDIMENSIONAL SCALING (MDS);

ALGORITHMS;

EID: 20744446730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discr. Comput. Geom., 22 (1999), 481-504.
2. N. Amenta, M. Bern and D. Eppstein. The crust and the β-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60 (1998), 125-135.
3. N. Amenta, S. Choi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Internat. J. Comput. Geom. Applications, 12 (2002), 125-141.
4. S. Arya, D. M. Mount, N. S. Netanyahu and R. Silverman. An optimal algorithm for approximate nearest neighbor searching in fixed dimension. J. ACM 45(6):891-923, (1998).
5. D. Attali, J.-D. Boissonnat and A. Lieutier. Complexity of the delaunay triangulation of points on surfaces: the smooth case. In Proc. 19th Ann. Sympos. Comput. Geom., (2003), 201-210.
6. C. Bregler and S. M. Omohundro. Nonlinear manifold learning for visual speech recognition. Proc. 5th Internat. Conf. Comput. Vision, (1995), 494-499.
7. J. D. Boissonnat and P. Cazals. Smooth surface reconstruction via natural neighbor interpolation of distance functions. Proc. 16th Ann. Sympos. Comput. Geom., (2000), 223-232.
8. S.-W. Cheng, T.K. Dey, H. Edelsbrunner, M.A. Facello, and S.-H. Teng. Sliver Exudation. Journal of ACM, 47 (2000), 883-904.
9. T. F. Cox and M. A. A. Cox. Multidimensional scaling. Chapman and Hall, London, 1994.
10. T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. Pmc. 12th Ann. ACM-SIAM Sympos. Discrete Algorithms, (1999), 893-894.
11. T. K. Dey, J. Giesen, S. Goswami and W. Zhao. Shape dimension and approximation from samples. Discrete Comput. Geom. 19 (2003), 419-434.
12. H. Edelsbrunner and N. Shah. Triangulating topological spaces. Proc. 10th ACM Sympos. Comput. Geom., (1994), 285-292.
13. S. Funke and E.A. Ramos. Smoooth-surface reconstruction in nearlinear time. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, (2002).
14. J. Giesen. Curve reconstruction, the TSP, and Menger's theorem on length. Proc. 15th Ann. Sympos. Comput. Geom., (1999), 207-216.
15. J. Giesen and U. Wagner. Shape dimension and intrinsic metric from samples of manifolds. Proceedings of the 19th Annual ACM Symposium on Computational Geometry, 2003, 329-337.
16. P. Indyk. Algorithmic applications of low-distorion geometric embeddings. 42nd Anna. IEEE Sympos. Foundations Comput. Sci., (2001), 10-33.
17. T. Martinetz and K. Schulten. Topology preserving networks. Neural Networks, 7 (1994), 507-522.
18. J. B. Tenenbaum, V. de Silva and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science 290 (5500), 2000.
19. K. M.-K. Yip. KAM: A System for Intelligently Guiding Numerical Experimentation by Computer. The MIT Press, Cambridge, Massachusetts, 1991.