A greedy Delaunay-based surface reconstruction algorithm

Visual Computer

Volumn 20, Issue 1, 2004, Pages 4-16

  Cohen Steiner, David ^a   Da, Frank ^a  

^a INRIA   (France)

Author keywords

Advancing front method; Delaunay triangulation; Surface reconstruction

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER GRAPHICS; DECISION MAKING; MATHEMATICAL MODELS; PROBLEM SOLVING; TENSORS; TOPOLOGY; TRIANGULATION;

ADVANCING FRONT METHOD; DELAUNAY TRIANGULATION; NONUNIFORM SAMPLING; SURFACE RECONSTRUCTION;

IMAGE RECONSTRUCTION;

EID: 2342591360     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-003-0217-z     Document Type: Article

References (17)

1. Adamy U, Giesen J, John M (2000) The λ-complex and surface reconstruction. In: Abstracts of the 16th European workshop on computational geometry, Ben-Gurion University of the Negev, 13-15 March 2000, pp 14-17
2. Alboul L, Kloosterman G, Traas C, van Damme R (2000) Best data-dependent triangulations. J Comput Appl Math 119:1-12
3. Amenta N, Bern M (1999) Surface reconstruction by Voronoi filtering. Discrete Comput Geom 22(4):481-504
4. Amenta N, Bern M, Eppstein D (1998) The crust and the β-skeleton: combinatorial curve reconstruction. Graph Models Image Process 60:125-135
5. Amenta N, Choi S, Dey TK, Leekha N (2000) A simple algorithm for homeomorphic surface reconstruction. In: Proceedings of the 16th annual ACM symposium on computational geometry, Hong Kong University, 12-14 June 2000, pp 213-222
6. Amenta N, Choi S, Kolluri RK (2001) The power crust, unions of balls, and the medial axis transform. Comput Geom Theory Appl 19:127-153
7. Bernardini F, Mittleman J, Rushmeir H, Silva C, Taubin G (1999) The ball-pivoting algorithm for surface reconstruction. IEEE Trans Visual Comput Graph 5(4):349-359
8. Boissonnat J-D (1984) Geometric structures for three-dimensional shape representation. ACM Trans Graph 3(4):266-286
9. Boissonnat J-D, Cazals F (2000) Smooth surface reconstruction via natural neighbour interpolation of distance functions. In: Proceedings of the 16th annual ACM symposium on computational geometry, Hong Kong University, 12-14 June 2000, pp 223-232
10. Brandt JW (1994) Convergence and continuity criteria for discrete approximations of the continuous planar skeleton. CGVIP Image Understand 59(1):116-124
11. Dey TK, Giesen J (2001) Detecting undersampling in surface reconstruction. In: Proceedings of the 17th annual symposium on computational geometry, Tufts University, Medford, MA, 3-5 June 2001, pp 257-263. ACM Press, New York
12. Edelsbrunner H (1992) Weighted alpha shapes. Technical Report UIUCDCS-R-92-1760, Department of Computer Science, University of Illinois, Urbana, IL
13. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1992) Surface reconstruction from unorganized points. Comput Graph 26(2):71-78. Proceedings of SIGGRAPH '92, Chicago, 26-31 July 1992
14. Medioni G, Lee MS, Tang CK (2000) A computational framework for segmentation and grouping. Elsevier, Amsterdam
15. Petitjean S, Boyer E (2001) Regular and non-regular point sets: properties and reconstruction. Comput Geom Theory Appl 19:101-126
16. Sethian JA (1996) Level set methods. Cambridge University Press, Cambridge, UK
17. Zhao HK, Osher S, Merriman B, Kang M (2000) Implicit nonparametric shape reconstruction from unorganized points using a variational level set method. Comput Vision Image Understand 80(3):295-319