Learning smooth objects by probing

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 198-207

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

^a INRIA   (France)

^b Stanford University   (United States)

Author keywords

Blind surface approximation; Delaunay refinement; Interactive surface reconstruction; Manifold learning; Surface meshing

Indexed keywords

BLIND SURFACE APPROXIMATION; DELAUNAY REFINEMENT; INTERACTIVE SURFACE RECONSTRUCTION; MANIFOLD LEARNING; SURFACE MESHING;

APPROXIMATION THEORY; PROBLEM SOLVING; SURFACE PHENOMENA;

LEARNING SYSTEMS;

EID: 33244476040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064124     Document Type: Conference Paper

References (20)

1. Panagiotis D. Alevizos, Jean-Daniel Boissonnat, and Mariette Yvinec. Non-convex contour reconstruction. J. Symbolic Comput., 10:225-252, 1990.
2. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 213-222, 2000.
3. Nina Amenta and Marshall Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481-504, 1999.
4. Dominique Attali, Jean-Daniel Boissonnat, and André Lieutier. Complexity of the Delaunay triangulation of points on surfaces: the smooth case. In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 201-210, 2003.
5. Jean-Daniel Boissonnat and Steve Oudot, Provably good sampling and meshing of surfaces. Graphical Models (special issue on Solid Modeling), 2005, To appear.
6. Jean-Daniel Boissonnat and Mariette Yvinec. Probing a scene of non-convex polyhedra. Algorithmica, 8:321-342, 1992.
7. M. Do Carmo. Riemannian Geometry. Birkhäuser, Boston, Basel, Berlin, 1992.
8. L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 274-280, 1993.
9. R. Cole and C. K. Yap. Shape from probing. J. Algorithms, 8(1):19-38, March 1987.
10. T. K. Dey and S. Goswami. Provable surface reconstruction from noisy samples. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 330-339, 2004.
11. D. P. Dobkin, H. Edelsbrunner, and C. K. Yap. Probing convex polytopes. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 424-432, 1986.
12. H. Federer. Geometric Measure Theory. Springer-Verlag, 1970.
13. P. M. Gruber. Approximation of convex bodies. In Peter M. Gruber and J. M. Wills, editors, Convexity and its Applications, pages 131-162. Birkhäuser, Basel, Switzerland, 1983.
14. M. Lindenbaum and A. M. Bruckstein. Blind approximation of planar convex sets. IEEE Trans. Robot. Autom., 10(4):517-529, August 1994.
15. W. Lorensen and H. Cline. Marching cubes: a high resolution 3d surface construction algorithm. Comput. Graph., 21(4):163-170, 1987.
16. T. J. Richardson. Approximation of planar convex sets from hyperplanes probes, Discrete and Computational Geometry, 18:151-177, 1997.
17. Günter Rote. The convergence rate of the Sandwich algorithm for approximating convex functions. Computing, 48:337-361, 1992.
18. Steven S. Skiena. Geometric reconstruction problems. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 26, pages 481-490. CRC Press LLC, Boca Raton, FL, 1997.
19. J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski. Information-based Complexity. Academic Press, 1988.
20. J. F. Traub and A. G. Werschulz. Complexity and Information. Cambridge University Press, 1998.