Shape dimension and approximation from samples

Discrete and Computational Geometry

Volumn 29, Issue 3, 2003, Pages 419-434

  Dey, Tamal K ^a   Giesen, Joachim ^a   Goswami, Samrat ^a   Zhao, Wulu ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038310007     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2838-9     Document Type: Article

References (27)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22 (1999), 481-504.
2. N. Amenta, M. Bern and D. Eppstein. The crust and the β-skeleton: combinatorial curve reconstruction. Graph. Models Image Process., 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. Appl., 12 (2002), 125-141.
4. C. L. Bajaj, V. Pascucci and D. R. Schikore. Visualization of scalar topology for structural enhancement. Proc. IEEE Visualization 98, 1998, pp. 18-23.
5. C. Bregler and S. M. Omohundro. Nonlinear manifold learning for visual speech recognition. Proc. 5th Internat. Conf. Comput. Vision, 1995, pp. 494-499.
6. J. D. Boissonnat and F. Cazals. Smooth surface reconstruction via natural neighbor interpolation of distance functions. Proc. 16th Ann. Sympos. Comput. Geom., 2000, pp. 223-232.
7. M. P. Do Carmo. Differential Geometry of Curves and Surfaces. Prentice-Hall, Englewood Cliffs, NJ, 1976.
8. T. F. Cox and M. A. A. Cox. Multidimensional Scaling. Chapman and Hall, London, 1994.
9. T. K. Dey, S. Funke and E. A. Ramos. Surface reconstruction in almost linear time under locally uniform sampling. Proc. European Workshop on Comput. Geom., Berlin, March 2001.
10. T. K. Dey and J. Giesen. Detecting undersampling in surface reconstruction. Proc. 17th Ann. Sympos. Comput. Geom., 2001, pp. 257-263.
11. T. K. Dey and P. Kumar. A simple provable algorithm for curve reconstruction. Proc. 12th Ann. ACM - SIAM Sympos. Discrete Algorithms, 1999, pp. 893-894.
12. H. Edelsbrunner, D.G. Kirkpatrick and R. Seidel. On the shape of a set of points in the plane. IEEE Trans. Inform. Theory, 29 (1983), 551-559.
13. H. Edelsbrunner and E. P. Mücke. Three-dimensional alpha shapes. ACM Trans. Graphics, 13 (1994), 43-72.
14. H. Edelsbrunner, M. A. Facello and J. Liang. On the definition and the construction of pockets in macromolecules. Discrete Appl. Math., 88 (1998), 83-102.
15. G. A. Edgar. Measure, Topology and Fractal Geometry. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1990.
16. J. Erickson. Nice point sets can have nasty Delaunay triangulations. Proc. 17th Ann. Sympos. Comput. Geom., 2001, pp. 96-105.
17. K. J. Falconer. The Geometry of Fractal Sets. Cambridge University Press, Cambridge, 1985.
18. J. Giesen. Curve reconstruction, the TSP, and Menger's theorem on length. Proc. 15th Ann. Sympos. Comput. Geom., 1999, pp. 207-216.
19. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. Proc. 42nd Ann. IEEE Sympos. Foundations Comput. Sci., 2001, pp. 10-33.
20. B. B. Mandelbrot. The Fractal Geometry of Nature. Freeman, New York, 1983.
21. T. Martinetz and K. Schulten. Topology preserving networks. Neural Networks, 7 (1994), 507-522.
22. D. Silver and X. Wang. Tracking scalar features in unstructured datasets. Proc. IEEE Visualization 98, 1998, pp. 79-86.
23. C-K. Tang and G. Medioni. Extremal feature extraction from 3-D vector and noisy scalar fields. Proc. IEEE Visualization 98, 1998, pp. 95-102.
24. J. B. Tenenbaum, V. de Silva and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290 (2000), 5500.
25. K. M.-K. Yip. KAM: A System for Intelligently Guiding Numerical Experimentation by Computer. The MIT Press, Cambridge, MA, 1991.
26. http://www.cis.ohio-state.edu/∼tamaldey/cocone.html.
27. http://www.cgal.org.