Abstract
The topology of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the literature. These methods operate locally on models, which makes their effect on topology hard to predict and analyze. Most existing methods also tend to exhibit various disturbing artifacts, such as shrinking of the input and splitting of its components. We propose a novel top-down method for topology simplification that avoids the problems common in existing methods. The method starts with a simple, genus-zero mesh that bounds the input and gradually introduces topological features by a series of carving operations. Through this process a multiresolution stream of meshes is created with increasing topologic level of detail. Following the proposed approach, we present a practical carving algorithm that is based on the Constrained Delaunay Tetrahedralization (CDT). The algorithm pretetrahedralizes the complement of the input with respect to its convex hull and then eliminates tetrahedra in a prioritized manner. We present quality results for two families of meshes that are difficult to simplify by all existing methods known to us - topologically complex and highly clustered meshes.
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
Amenta, N., Bern, M.W.: Surface reconstruction by voronoi filtering. In: Symposium on Computational Geometry, pp. 39–48 (1998)
Andujar, C., Ayala, D., Brunet, P., Joan-Arinyo, R., Sole, J.: Automatic generation of multi-resolution boundary representations. Computer-Graphics Forum 15(3), 87–96 (1996)
Attene, M., Spagnuolo, M.: Automatic surface reconstruction from point sets in space. Computer Graphics Forum 19(3), 457–465 (2000)
Bernardini, F., Bajaj, C.: Sampling and reconstructing manifolds using alpha-shapes. Technical Report CSD-97-013, Department of Computer Sciences, Purdue University (1997)
Bischoff, S., Kobbelt, L.P.: Isosurface reconstruction with topology control. Pacific Graphics 00(246) (2002)
Chew, L.P.: Constrained delaunay triangulations. Algorithmica 4(1), 97–108 (1989)
Edelsbrunner, H.: Weighted alpha shapes. Technical Report UIUCDCS-R-92-1760, Department of Computer Science, University of Illinois at Urbana-Champaign (1992)
Edelsbrunner, H., Mücke, E.: Three-dimensional alpha shapes. ACM transactions on Graphics 13(1), 43–72 (1994)
El-Sana, J., Varshney, A.: Topology simplification for polygonal virtual environments. IEEE Transactions on Visualization and Computer Graphics 4(2), 133–144 (1998)
Garland, M., Heckbert, P.: Surface simplification using quadric error metrics. In: Proceedings of SIGGRAPH 1997, pp. 209–216. ACM Press, New York (1997)
Gerstner, T., Pajarola, R.: Topology preserving and controlled topology simplifying multiresolution isosurface extraction. In: Proceedings of the IEEE Visualization 2000, pp. 259–266 (2000)
Giesen, J., John, M.: Surface reconstruction based on a dynamical system. Computer Graphics Forum 21(3) (2002)
Gopi, M., Krishnan, S., Silva, C.T.: Surface reconstruction based on lower dimensional localized delaunay triangulation. 19(3) (2000)
He, T., Hong, L., Varshney, A., Wang, S.: Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics 2(2), 171–184 (1996)
Ju, T., Zhou, Q.-Y., Hu, S.-M.: Editing the topology of 3d models by sketching. ACM Trans. Graph. 26(3), 42 (2007)
Kobbelt, L.P., Vorsatz, J., Labsik, U., Seidel, H.P.: A shrink wrapping approach to remeshing polygonal surfaces. Computer Graphics Forum 18(3), 119–130 (1999)
Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. In: Proceedings of SIGGRAPH 1997, pp. 198–208. ACM Press, New York (1997)
Popović, J., Hoppe, H.: Progressive simplicial complexes. In: Proceedings of SIGGRAPH 1997, ACM SIGGRAPH, pp. 217–224. ACM Press, New York (1997)
Rossignac, J., Borrel, P.: Multi-resolution 3D approximations for rendering. In: Modeling in Computer Graphics, pp. 455–465. Springer, Heidelberg (1993)
Schroeder, W.J.: A topology modifying progressive decimation algorithm. In: IEEE Visualization 1997 Proceedings, pp. 205–212. SIGGRAPH Press (1997)
Shewchuk, J.R.: A condition guaranteeing the existence of higher-dimensional constrained delaunay triangulations. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Association for Computing Machinery, (Minneapolis, Minnesota), pp. 76–85 (1998)
Shewchuk, J.R.: Sweep algorithms for constructing higher-dimensional constrained delaunay triangulations. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, pp. 350–208 (2000)
Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1), 86–95 (2002)
Si, H.: TetGen. A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator. Version 1.4. User’s Manual (2006), http://tetgen.berlios.de
Wood, Z., Hoppe, H., Desbrun, M., Schröder, P.: Removing excess topology from isosurfaces. ACM Transactions on Graphics 23(2), 190–208 (2004)
Zhou, Q.-Y., Ju, T., Hu, S.-M.: Topology repair of solid models using skeletons. IEEE Transactions on Visualization and Computer Graphics 13(4), 675–685 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagbi, N., El-Sana, J. (2008). A Carving Framework for Topology Simplification of Polygonal Meshes. In: Chen, F., Jüttler, B. (eds) Advances in Geometric Modeling and Processing. GMP 2008. Lecture Notes in Computer Science, vol 4975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79246-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-79246-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79245-1
Online ISBN: 978-3-540-79246-8
eBook Packages: Computer ScienceComputer Science (R0)