Abstract
Modern 3D acquisition and modeling tools generate high-quality, detailed geometric models. However, in order to cope with the associated complexity, several mesh decimation methods have been developed in the recent years. On the other hand, a common problem of geometric modeling tools is the generation of consistent three-dimensional meshes. Most of these programs output meshes containing degenerate faces, T-vertices, narrow gaps and cracks. Applying well-established decimation methods to such meshes results in severe artifacts due to lack of consistent connectivity information. The industrial relevance of this problem is emphasized by the fact that as an output of most of the commercial CAD/CAM and other modeling tools, the user usually gets consistent meshes only for separate polygonal patches as opposed to the whole mesh.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stereolitography interface specification. SLA CAD, 3D Systems Inc. (Valencia, CA), 1989, p/n 500650S01–00.
Gill Barequet and Subodh Kumar. Repairing CAD models. In Roni Yagel and Hans Hagen, editors, IEEE Visualization ‘87, pages 363–370, 1997.
Geoffrey Butlin and Clive Stops. CAD data repair. In 5th International Meshing Roundtable, pages 7–12, 1996.
Michael Garland and Paul S. Heckbert. Surface simplification using quadric error metrics. In ACM SIGGRAPH Computer Graphics Proceedings, pages 209–216, 1997.
Andre Guéziec, Gabriel Taubin, Francis Lazarus, and Bill Horn. Cutting and stitching: Converting sets of polygons to manifold surfaces. Trans. on Visualization and Computer Graphics,7(2), pages 136–151, 2001.
I. Guskov and Z. Wood. Topological noise removal. In Graphics Interface, 2001.
Hugues Hoppe. Progressive meshes. Computer Graphics, 30 (Annual Conference Series), pages 99–108, 1996.
Kok-Lim Low and Tiow Seng Tan. Model simplification using vertex-clustering. In Symposium on Interactive 3D Graphics, pages 75–82, 188, 1997.
T. M. Murali and Thomas A. Funkhouser. Consistent solid and boundary representations from arbitrary polygonal data. In Symposium on Interactive 3D Graphics,pages 155–162, 196, 1997.
F. Nooruddin and G. Turk. Simplification and repair of polygonal models using volumetric techniques. Technical Report GITGVU -99–37, Georgia Institute of Technology, 1999.
Marcin Novotni and Reinhard Klein. Computing geodesic distances on triangular meshes. Submitted for publication to Winter School on Computer Graphics 2002.
Jovan Popovi• and Hugues Hoppe. Progressive simplicial complexes. In ACM SIG-GRAPH Computer Graphics Proceedings, pages 217–224, 1997.
J. Rossignac and P. Borrel. Multi-resolution 3D approximations for rendering. In Modeling in Computer Graphics. Springer-Verlag, 1993.
Greg Turk and Marc Levoy. Zippered polygon meshes from range images. Computer Graphics, 28 (Annual Conference Series), pages 311–318, 1994.
Karsten Weihe and Thomas Willhalm. Why CAD data repair requires discrete algorithmic techniques. In 2nd Workshop on Algorithm Engineering, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Borodin, P., Novotni, M., Klein, R. (2002). Progressive Gap Closing for MeshRepairing. In: Vince, J., Earnshaw, R. (eds) Advances in Modelling, Animation and Rendering. Springer, London. https://doi.org/10.1007/978-1-4471-0103-1_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0103-1_13
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1118-4
Online ISBN: 978-1-4471-0103-1
eBook Packages: Springer Book Archive