Automatic restoration of polygon models

ACM Transactions on Graphics

Volumn 24, Issue 4, 2005, Pages 1332-1352

  Bischoff, Stephan ^a   Pavic, Darko ^a   Kobbelt, Leif ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Mesh repair; Polygon meshes; Surface extraction; Voxelization

Indexed keywords

MESH REPAIR; POLYGON MESHES; SURFACE EXTRACTION; VOXELIZATION;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS);

FEATURE EXTRACTION;

EID: 33645798083     PISSN: 07300301     EISSN: 07300301     Source Type: Conference Proceeding    
DOI: 10.1145/1095878.1095883     Document Type: Article

References (32)

1. ANDUJ́AR, C., BRUNET, P., AND AYALA, D. 2002. Topology-reducing surface simplification using a discrete solid representation. ACM Trans. Graph. 21, 2, 88-105.
2. BAREQUET, G., DUNCAN, C., AND KUMAR, S. 1998. Rsvp: A geometric toolkit for controlled repair of solid models. IEEE Trans. Visualiz. Comput. Graph. 4, 2, 162-177.
3. BAREQUET, G. AND KUMAR, S. 1997. Repairing cad models. In Proceedings of the IEEE Visualization. 363-370.
4. BAREQUET, G. AND SHARIR, M. 1995. Filling gaps in the boundary of a polyhedron. Comput. Aided Geomet. Des. 12, 2, 207-229.
5. BISCHOFF, S. AND KOBBELT, L. 2002. Isosurface reconstruction with topology control. In Proceedings of the Pacific Graphics. 246-255.
6. BøHN, J. AND WOZNY, M. 1992. Automatic cad-model repair: Shell-closure. In Proceedings of the Symposium on Solid Freeform Fabrication. 86-94.
7. BORODIN, P., NOVOTNI, M., AND KLEIN, R. 2002. Progressive gap closing for mesh repairing. In Advances in Modelling, Animation and Rendering, J. Vince and R. Earnshaw, Eds. Springer Verlag, 201-213.
8. BRUNET, P. AND NAVAZO, I. 1990. Solid representation and operation using extended octrees. ACM Trans. Graph. 9, 2, 170-197.
9. DAVIS, J., MARSCHNER, S., GARE, M., AND LEVOY, M. 2002. Filling holes in complex surfaces using volumetric diffusion. In Proceedings of the International Symposium on 3D Data Processing, Visualization, Transmission. 428-438.
10. DOLENC, A. AND MÄKELÄ, I. 1991. Optimized triangulation of parametric surfaces. Techn. rep. TKO-B74, Helsinki University of Technology.
11. FRISKEN, S. F., PERRY, R. N., ROCKWOOD, A. P., AND JONES, T. R. 2000. Adaptively sampled distance fields: a general representation of shape for computer graphics. In Proceedings of SIGGRAPH. 249-254.
12. GARLAND, M. AND HECKBERT, P. S. 1997. Surface simplification using quadric error metrics. In Proceedings of SIGGRAPH. 209-216.
13. GIBSON, S. F. F. 1998. Using distance maps for accurate surface representation in sampled volumes. In Proceedings of IEEE Symposium on Volume Visualization. 23-30.
14. GONZALEZ, R. AND WOODS, R. 1992. Digital Image Processing. Addison-Wesley.
15. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. Obbtree: A hierarchical structure for rapid interference detection. In Proceedings of SIGGRAPH. 171-180.
16. GHEß, A. AND KLEIN, R. 2003. Efficient representation and extraction of 2-manifold isosurfaces using kd-trees. In Proceedings of the 11th Pacific Conference on Computer Graphics and Applications (PG'03). 364-376.
17. GUÉZIEC, A., TAUBIN, G., LAZARUS, F., AND HORN, B. 2001. Cutting and stitching: Converting sets of polygons to manifold surfaces. IEEE Trans. Visualiz. Comput. Graph. 7, 2, 136-151.
18. GUSKOV, I. AND WOOD, Z. J. 2001. Topological noise removal. In Proceedings of Graphics Interface. 19-26.
19. Ju, T. 2004. Robust repair of polygonal models. ACM Trans. Graph. 23, 3, 888-895.
20. Ju, T., LOSASSO, F., SCHAEFER, S., AND WARREN, J. 2002. Dual contouring of hermite data. In Proceedings of the SIGGRAPH. 339-346.
21. KOBBELT, L., CAMPAGNA, S., VORSATZ, J., AND SEIDEL, H.-P. 1998. Interactive multi-resolution modeling on arbitrary meshes. In Proceedings of SIGGRAPH. 105-114.
22. KOBBELT, L. P., BOTSCH, M., SCHWANECKE, U., AND SEIDEL, H.-P. 2001. Feature sensitive surface extraction from volume data. In Proceedings of SIGGRAPH. 57-66.
23. KONG, T. AND ROSENFELD, A. 1989. Digital topology: Introduction and survey. Comput. Vision, Graph. Image Process. 48, 357-397.
24. LIEPA, P. 2003. Filling holes in meshes. In Proceedings of the Symposium on Geometry Processing 03. 200-205.
25. LORENSEN, W. E. AND CLINE, H. E. 1987. Marching cubes: A high resolution 3d surface construction algorithm. In Proceedings of SIGGRAPH. 163-169.
26. NOORUDDIN, F. AND TURK, G. 2003. Simplification and repair of polygonal models using volumetric techniques. IEEE Trans. Visualiz. Comput. Graph. 9, 2, 191-205.
27. SAMET, H. AND WEBBER, R. E. 1988. Hierarchical data structures and algorithms for computer graphics. Part i. IEEE Comput. Graph. Appl. 8, 3, 48-68.
28. TAUBIN, G. 1995. A signal processing approach to fair surface design. In Proceedings of SIGGRAPH. 351-358.
29. TURK, G. AND LEVOY, M. 1994. Zippered polygon meshes from range images. In Proceedings of SIGGRAPH 94. 311-318.
30. VARADHAN, G., KRISHNAN, S., KIM, Y., DIGGAVI, S., AND MANOCHA, D. 2003. Efficient max-norm distance computation and reliable voxelization. In Proceedings of the Symposium on Geometry Processing. 116-126.
31. WEIHE, K. AND WILLHALM, T. 1998. Why cad data repair requires discrete algorithmic techniques. In Proceedings of the 2nd Workshop on Algorithm Engineering. 1-12.
32. Wu, J. AND KOBBELT, L. 2003. A stream algorithm for the decimation of massive meshes. In Proceedings of Graphics Interface. 185-192.