Abstract
Given an input 3D geometry such as a triangle soup or a point set, we address the problem of generating a watertight and orientable surface triangle mesh that strictly encloses the input. The output mesh is obtained by greedily refining and carving a 3D Delaunay triangulation on an offset surface of the input, while carving with empty balls of radius alpha. The proposed algorithm is controlled via two user-defined parameters: alpha and offset. Alpha controls the size of cavities or holes that cannot be traversed during carving, while offset controls the distance between the vertices of the output mesh and the input. Our algorithm is guaranteed to terminate and to yield a valid and strictly enclosing mesh, even for defect-laden inputs. Genericity is achieved using an abstract interface probing the input, enabling any geometry to be used, provided a few basic geometric queries can be answered. We benchmark the algorithm on large public datasets such as Thingi10k, and compare it to state-of-the-art approaches in terms of robustness, approximation, output complexity, speed, and peak memory consumption. Our implementation is available through the CGAL library.
Supplemental Material
- Rémi Allegre, Raphaëlle Chaine, and Samir Akkouche. 2005. Convection-driven dynamic surface reconstruction. In International Conference on Shape Modeling and Applications. IEEE, IEEE, Cambridge, Massachusetts, USA., 33--42.Google Scholar
Digital Library
- Pierre Alliez, Stéphane Tayeb, and Camille Wormser. 2021. 3D Fast Intersection and Distance Computation. In CGAL User and Reference Manual (5.3.1 ed.). CGAL Editorial Board, Sophia Antipolis, France. https://doc.cgal.org/5.3.1/Manual/packages.html#PkgAABBTreeGoogle Scholar
- Marco Attene, Marcel Campen, and Leif Kobbelt. 2013. Polygon mesh repairing: An application perspective. ACM Computing Surveys (CSUR) 45, 2 (2013), 1--33.Google Scholar
Digital Library
- Gino van den Bergen. 1997. Efficient collision detection of complex deformable models using AABB trees. Journal of graphics tools 2, 4 (1997), 1--13.Google Scholar
Digital Library
- Matthew Berger, Andrea Tagliasacchi, Lee M Seversky, Pierre Alliez, Gael Guennebaud, Joshua A Levine, Andrei Sharf, and Claudio T Silva. 2017. A survey of surface reconstruction from point clouds. Computer Graphics Forum 36 (2017), 301--329.Google Scholar
Digital Library
- Fausto Bernardini and Chandrajit L Bajaj. 1997. Sampling and reconstructing manifolds using alpha-shapes. In Proceedings of Canadian Conference on Computational Geometry. Unknown publisher, Kingston, Ontario, Canada, 193--198.Google Scholar
- Fausto Bernardini, Chandrajit L Bajaj, Jindong Chen, and Daniel R Schikore. 1999. Automatic reconstruction of 3D CAD models from digital scans. International Journal of Computational Geometry and Applications 9, 04n05 (1999), 327--369.Google Scholar
Cross Ref
- Stefan Bischoff, Darko Pavic, and Leif Kobbelt. 2005. Automatic Restoration of Polygon Models. ACM Transactions on Graphics 24 (2005), 1332--1352.Google Scholar
Digital Library
- Jean-Daniel Boissonnat. 1984. Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics (TOG) 3, 4 (1984), 266--286.Google Scholar
Digital Library
- Jean-Daniel Boissonnat and Steve Oudot. 2005. Provably good sampling and meshing of surfaces. Graph. Models 67, 5 (2005), 405--451.Google Scholar
Digital Library
- Mario Botsch and Leif Kobbelt. 2001. A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes. In Proceedings of the Vision Modeling and Visualization conference. Aka GmbH, Stuttgart, Germany, 283--290.Google Scholar
- Hervé Brönnimann, Christoph Burnikel, and Sylvain Pion. 2001. Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics 109, 1--2 (2001), 25--47.Google Scholar
Digital Library
- Fatih Calakli and Gabriel Taubin. 2011. SSD: Smooth signed distance surface reconstruction. Computer Graphics Forum 30, 7 (2011), 1993--2002.Google Scholar
Cross Ref
- Stéphane Calderon and Tamy Boubekeur. 2017. Bounding proxies for shape approximation. ACM Transactions on Graphics (TOG) 36, 4 (2017), 1--13.Google Scholar
Digital Library
- Marcel Campen and Leif Kobbelt. 2010. Exact and robust (self-) intersections for polygonal meshes. Computer Graphics Forum 29, 2 (2010), 397--406.Google Scholar
Cross Ref
- Chia-Tche Chang, Bastien Gorissen, and Samuel Melchior. 2011. Fast oriented bounding box optimization on the rotation group SO (3, R). ACM Transactions on Graphics (TOG) 30, 5 (2011), 1--16.Google Scholar
Digital Library
- Siu-Wing Cheng, Tamal K Dey, and Joshua A Levine. 2008. A practical Delaunay meshing algorithm for a large class of domains. In Proceedings of the 16th International Meshing Roundtable. IMR, Springer, USA, 477--494.Google Scholar
Cross Ref
- Siu-Wing Cheng, Tamal K Dey, and Edgar A Ramos. 2010. Delaunay refinement for piecewise smooth complexes. Discrete & Computational Geometry 43, 1 (2010), 121--166.Google Scholar
Digital Library
- Siu-Wing Cheng, Tamal K. Dey, and Jonathan Shewchuk. 2012. Delaunay Mesh Generation (1st ed.). Chapman and Hall/CRC, Florida, USA.Google Scholar
- Tamal Dey. 2010. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis by Tamal K. Dey Cambridge University Press. SIGACT News 41, 1 (mar 2010), 24--27.Google Scholar
- Lorenzo Diazzi and Marco Attene. 2021. Convex Polyhedral Meshing for Robust Solid Modeling. ACM Transactions on Graphics 40, 6, Article 259 (dec 2021), 16 pages.Google Scholar
Digital Library
- Herbert Edelsbrunner. 2003. Surface reconstruction by wrapping finite sets in space. In Discrete and computational geometry. Springer, USA, 379--404.Google Scholar
- Herbert Edelsbrunner and Ernst P Mücke. 1994. Three-dimensional alpha shapes. ACM Transactions on Graphics (TOG) 13, 1 (1994), 43--72.Google Scholar
Digital Library
- Joachim Giesen, Frédéric Cazals, Mark Pauly, and Afra Zomorodian. 2006. The conformal alpha shape filtration. The Visual Computer 22, 8 (2006), 531--540.Google Scholar
Cross Ref
- Joachim Giesen and Matthias John. 2002. Surface reconstruction based on a dynamical system. Computer graphics forum 21, 3 (2002), 363--371.Google Scholar
- Stefan Gumhold, Pavel Borodin, and Reinhard Klein. 2003. Intersection free simplification. International Journal of Shape Modeling 9, 02 (2003), 155--176.Google Scholar
Cross Ref
- Baining Guo, Jai Menon, and Brian Willette. 1997. Surface reconstruction using alpha shapes. Computer graphics forum 16, 4 (1997), 177--190.Google Scholar
- Yixin Hu, Teseo Schneider, Bolun Wang, Denis Zorin, and Daniele Panozzo. 2020. Fast tetrahedral meshing in the wild. ACM Transactions on Graphics (TOG) 39, 4 (2020), 117--1.Google Scholar
Digital Library
- Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, and Daniele Panozzo. 2018. Tetrahedral Meshing in the Wild. ACM Trans. Graph. 37, 4, Article 60 (July 2018), 14 pages. Google Scholar
Digital Library
- Jingwei Huang, Hao Su, and Leonidas J. Guibas. 2018. Robust Watertight Manifold Surface Generation Method for ShapeNet Models. CoRR abs/1802.01698 (2018), 1--10. http://arxiv.org/abs/1802.01698Google Scholar
- Jingwei Huang, Yichao Zhou, and Leonidas J. Guibas. 2020. ManifoldPlus: A Robust and Scalable Watertight Manifold Surface Generation Method for Triangle Soups. CoRR abs/2005.11621 (2020), 1--10. arXiv:2005.11621 https://arxiv.org/abs/2005.11621Google Scholar
- Alec Jacobson, Ladislav Kavan, and Olga Sorkine-Hornung. 2013. Robust inside-outside segmentation using generalized winding numbers. ACM Transactions on Graphics (TOG) 32, 4 (2013), 1--12.Google Scholar
Digital Library
- Tao Ju. 2004. Robust Repair of Polygonal Models. ACM Transactions on Graphics 23, 3 (2004), 888--895.Google Scholar
Digital Library
- Franjo Juretić and Norbert Putz. 2011. A Surface-Wrapping Algorithm with Hole Detection Based on the Heat Diffusion Equation. In Proceedings of the 20th International Meshing Roundtable. Springer, New York, USA, 405--418.Google Scholar
Cross Ref
- Michael Kazhdan, Matthew Bolitho, and Hugues Hoppe. 2006. Poisson Surface Reconstruction. In Proceedings of EUROGRAPHICS Symposium on Geometry Processing. Eurographics Association, Cagliari, Sardinia, Italy, 61--70.Google Scholar
- Leif Kobbelt, Jens Vorsatz, Ulf Labsik, and Hans-Peter Seidel. 1999. A shrink wrapping approach to remeshing polygonal surfaces. Computer Graphics Forum 18, 3 (1999), 119--130.Google Scholar
Cross Ref
- Sebastian Koch, Albert Matveev, Zhongshi Jiang, Francis Williams, Alexey Artemov, Evgeny Burnaev, Marc Alexa, Denis Zorin, and Daniele Panozzo. 2019. ABC: A Big CAD Model Dataset For Geometric Deep Learning. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, USA, 1--10.Google Scholar
- YK Lee, Chin K Lim, Hamid Ghazialam, Harsh Vardhan, and Erling Eklund. 2010. Surface mesh generation for dirty geometries by the Cartesian shrink-wrapping technique. Engineering with Computers 26, 4 (2010), 377--390.Google Scholar
Digital Library
- Peter Liepa. 2003. Filling holes in meshes. In Proceedings of the ACM/Eurographics Symposium on Geometry Processing. ACM, Aachen, 200--205.Google Scholar
- Alexander Malyshev, Artem Zhidkov, Vadim Turlapov, and France Guyancourt. 2018. Adaptive mesh generation using shrink wrapping approach. In Proceedings of GraphiCon'2018. GraphiCon Scientific Society, Tomsk, Russia, 479--483.Google Scholar
- D Martineau, J Gould, and J Papper. 2016. An integrated framework for wrapping and mesh generation of complex geometries. In European Congress on Computational Methods in Applied Sciences and Engineering (Greece). ECCOMAS, Europe, 6938--6954.Google Scholar
Cross Ref
- Fakir Nooruddin and Greg Turk. 2003. Simplification and Repair of Polygonal Models Using Volumetric Techniques. IEEE Transactions on Visualization and Computer Graphics 9, 2 (2003), 191--205.Google Scholar
Digital Library
- Leonardo Sacht, Etienne Vouga, and Alec Jacobson. 2015. Nested cages. ACM Transactions on Graphics (TOG) 34, 6 (2015), 1--14.Google Scholar
Digital Library
- Pedro V Sander, Xianfeng Gu, Steven J Gortler, Hugues Hoppe, and John Snyder. 2000. Silhouette clipping. In Proceedings of the 27th annual conference on Computer graphics and interactive techniques. ACM Press, USA, 327--334.Google Scholar
Digital Library
- Silvia Sellán, Noam Aigerman, and Alec Jacobson. 2021. Swept Volumes via Spacetime Numerical Continuation. ACM Transactions on Graphics 40, 4 (2021), 11 pages.Google Scholar
Digital Library
- Chen Shen, James F. O'Brien, and Jonathan R. Shewchuk. 2004. Interpolating and Approximating Implicit Surfaces from Polygon Soup. ACM Transactions on Graphics 23, 3 (2004), 896--904.Google Scholar
Digital Library
- David A Stuart, Joshua A Levine, Ben Jones, and Adam W Bargteil. 2013. Automatic construction of coarse, high-quality tetrahedralizations that enclose and approximate surfaces for animation. In Proceedings of Motion on Games. ACM, USA, 213--222.Google Scholar
Digital Library
- Marek Teichmann and Michael Capps. 1998. Surface reconstruction with anisotropic density-scaled alpha shapes. In Proceedings of Visualization (Research Triangle Park, North Carolina, USA). IEEE, IEEE, USA, 67--72.Google Scholar
Cross Ref
- The CGAL Project. 2021. CGAL User and Reference Manual (5.3 ed.). CGAL Editorial Board, Sophia Antipolis, France. https://doc.cgal.org/5.3/Manual/packages.htmlGoogle Scholar
- Andreas Von Dziegielewski, Michael Hemmer, and Elmar Schömer. 2013. High precision conservative surface mesh generation for swept volumes. IEEE Transactions on Automation Science and Engineering 12, 1 (2013), 183--191.Google Scholar
Cross Ref
- Karl D. D. Willis, Yewen Pu, Jieliang Luo, Hang Chu, Tao Du, Joseph G. Lambourne, Armando Solar-Lezama, and Wojciech Matusik. 2021. Fusion 360 Gallery: A Dataset and Environment for Programmatic CAD Construction from Human Design Sequences. ACM Transactions on Graphics (TOG) 40, 4 (2021), 1--10.Google Scholar
Digital Library
- Hongyi Xu and Jernej Barbič. 2014. Signed Distance Fields for Polygon Soup Meshes. In Proceedings of Graphics Interface 2014 (Montreal, Quebec, Canada) (GI '14). Canadian Information Processing Society, CAN, 35--41.Google Scholar
Digital Library
- Wang Yifan, Noam Aigerman, Vladimir G Kim, Siddhartha Chaudhuri, and Olga Sorkine-Hornung. 2020. Neural cages for detail-preserving 3D deformations. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE, Nashville, 75--83.Google Scholar
Cross Ref
- Tong Zhao, Pierre Alliez, Tamy Boubekeur, Laurent Busé, and Jean-Marc Thiery. 2021. Progressive Discrete Domains for Implicit Surface Reconstruction. Computer Graphics Forum 40, 5 (2021), 143--156.Google Scholar
Cross Ref
- Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv:1605.04797 [cs.GR]Google Scholar
Recommendations
Mitered offset of a mesh using QEM and vertex split
SPM '08: Proceedings of the 2008 ACM symposium on Solid and physical modelingIn this paper, we present a mitered offsetting method of a triangular mesh. Though our main target application is machining tool path generation, it can also be applied to shelling/hollowing of solid objects, collision avoidance in robot path planning, ...
TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
TetGen is a C++ program for generating good quality tetrahedral meshes aimed to support numerical methods and scientific computing. The problem of quality tetrahedral mesh generation is challenged by many theoretical and practical issues. TetGen uses ...
Tetrahedral meshing of volumetric medical images respecting image edges
CAIP'11: Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part IIn this paper, a variational tetrahedral meshing approach is used to adapt a tetrahedral mesh to the underlying CT volumetric data so that image edges are well approximated in the mesh. Afterwards, tetrahedra in the mesh are classified into regions ...





Comments