Optimized triangle mesh reconstruction from unstructured points

Visual Computer

Volumn 19, Issue 1, 2003, Pages 23-37

  Liu, Yong Jin ^a   Yuen, Matthew Ming Fai ^a  

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

Author keywords

Geometric modeling; Mesh optimization; Mesh simplification; Three dimensional shape recovery

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FUNCTIONS; OPTIMIZATION; PATTERN MATCHING;

POLYGON MESHES;

IMAGE RECONSTRUCTION;

EID: 0037357226     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-002-0162-2     Document Type: Conference Paper

References (34)

1. Amenta N, Bern M, Kamvysselis M (1998) A new Voronoi-based surface reconstruction algorithm. In: Proceedings of SIGGRAPH '98. ACM SIGGRAPH, pp 415-421
2. Bardinet E, Cohen L, Ayache N (1998) A parametric deformable model to fit unstructured 3D data. Comput Vision Image Understanding 71(1):39-54
3. Berg M, Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry: algorithm and applications. Springer, Berlin Heidelberg New York
4. Bloomenthal J, Bajaj C, Blinn J, Cani-Gascuel M, Rockwood A, Wyvill B, Wyvill G (1997) Introduction to implicit surfaces. Morgan Kaufmann, San Francisco
5. Ciampalini A, Cignoni P, Montani C, Scopigno R (1997) Multi-resolution decimation based on global error. Vis Comput 13(5):228-246
6. Cignoni P, Rocchini C, Scopigno (1998) Metro: measuring error on simplified surfaces. Comput Graph Forum 17(2): 167-174
7. Cohen J, Varshney A, Manocha D, Turk G, Weber H, Agarwal P, Brooks F, Wright W (1996) Simplification envelopes. In: Proceedings of SIGGRAPH '96. ACM SIGGRAPH, pp 119-128
8. Cormen T, Leiserson C, Rivest R (1997) Introduction to algorithms. MIT Press,
9. Curless B, Levoy M (1996) A volumetric method for building complex models from range images. In: Proceedings of SIGGRAPH '96. ACM SIGGRAPH, pp 303-312
10. Eck M, Hoppe H (1996) Automatic reconstruction of B-spline surfaces of arbitrary topological type. In: Proceedings of SIGGRAPH' 96. ACM SIGGRAPH, pp 325-334
11. Frisken S, Perry R, Rockwood A, Jones T (2000) Adaptively sampled distance fields: a general representation of shape for computer graphics. In: Proceedings of SIGGRAPH '00. ACM SIGGRAPH, pp 249-254
12. Garland M (1999) Multiresolution modeling: survey and future opportunities. Eurographics '99, State of the art reports, pp 111-131
13. Garland M, Heckbert P (1997) Surface simplification using quadric error metrics. Proceedings of SIGGRAPH '97. ACM SIGGRAPH, pp 209-216
14. Gopi M, Krishnan S, Silva CT (2000) Surface reconstruction based on lower dimensional localized Delaunay triangulation. Comput Graph Forum (Eurographics '00 Proceedings) 19(3):467-478
15. Guskov I, Wood Z (2001) Topological noise removal. In: Proceedings Graphics Interface '01, pp 19-26
16. He T, Hong L, Varshney, Wang S (1996) Controlled topology simplification. IEEE Trans Vis Comput Graph 2(2):171-184
17. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1992) Surface reconstruction from unorganized points. In: Proceedings of SIGGRAPH '92. ACM SIGGRAPH, pp 71-78
18. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1993) Mesh optimisation. In: Proceedings of SIGGRAPH '93, ACM SIGGRAPH, pp 19-26
19. Hoppe H (1994) Surface reconstruction from unorganized points. PhD thesis, Department of Computer Science and Engineering, University of Washington
20. Hoppe H (1996) Progressive meshes. In: Proceedings of SIGGRAPH '96. ACM SIGGRAPH, pp 99-108
21. Kaufman A, Cohen D, Yagel R (1993) Volume graphics. IEEE Computer 26(7):51-64
22. Kobbelt L, Bareuther T, Seidel H-P (2000) Multiresolution shape deformations for meshes with dynamic vertex connectivity. Comput Graph Forum (Eurographics '00 Proceedings) 19(3):249-259
23. Kobbelt L, Campagna S, Seidel H-P (1998) A general framework for mesh decimation. In: Proceedings Graphics Interface'98, pp 43-50
24. Kobbelt L, Campagna S, Vorsatz J, Seidel H-P (1998) Interactive multi-resolution modeling on arbitrary meshes. In: Proceedings of SIGGRAPH '98. ACM SIGGRAPH, pp 105-114
25. Kobbelt L, Botsch M, Schwanecke U, Seidel H-P (2001) Feature sensitive surface extraction from volume data. In: Proceedings of SIGGRAPH '01, ACM SIGGRAPH, pp 57-66
26. Kobbelt L, Vorsatz J, Labsik U, Seidel H-P (1999) A shrink wrapping approach to remeshing polygonal surfaces. Comput Graph Forum (Eurographics '99 Proceedings), 18(3):119-129
27. Lindstrom P, Turk G (1998) Fast and memory efficient polygonal simplification. In: Proceedings of Visualization '98, pp 279-286
28. Lindstrom P, Turk G (1999) Evaluation of memoryless simplification. IEEE Trans Vis Comput Graph 5(2):98-115
29. Lindstrom P (2000) Out-of-core simplification of large polygonal models. In: Proceedings of SIGGRAPH '00. ACM SIGGRAPH, pp 259-262
30. Lorensen W, Cline H (1987) Marching cubes: a high resolution 3D surface construction algorithm. Comput Graph (SIGGRAPH '87 Proceedings) 21(4): 163-169
31. Montani C, Scateni R, Scopigno R (1994) A modified lookup table for implicit disambiguation of marching cubes. Vis Comput 10(6):353-355
32. Qin H, Terzopoulos D (1996) D-NURBS: A physics-based framework for geometric design. IEEE Trans Vis Comput Graph 2(1):85-96
33. Schroeder W, Martin H, Lorensen B (1998) The visualization toolkit, 2nd edn. Prentice Hall, Upper Saddle River, N.J.
34. Turk G. (1992) Re-tiling polygonal surfaces. Comput Graph (SIGGRAPH '92 Proceedings) 26(2):55-64