Exact and Efficient Intersection Resolution for Mesh Arrangements
Article No.: 165, Pages 1 - 14
Abstract
We propose a novel method to exactly and efficiently resolve intersections and self-intersections in triangle meshes. Our method contains two key components. First, we present a new concept of geometric predicates, called indirect offset predicates, to represent all intersection points through a new formulation and establish all necessary geometric predicates. Consequently, we reduce numerical errors in floating-point evaluations and improve the success rate of early stages of arithmetic filtering. Second, we develop localization and dimension reduction techniques for sorting, deduplicating, and locating the intersection points, thereby boosting efficiency and parallelism while maintaining accuracy. Rigorous testing confirms the robustness of our algorithm and consistency with previous methods. Comprehensive testing across diverse datasets further highlights the speed improvement achieved by our method, which is one order of magnitude faster than the state-of-the-art methods.
References
[1]
Marco Attene. 2014. Direct repair of self-intersecting meshes. Graphical Models 76, 6 (2014), 658--668.
[2]
Marco Attene. 2020. Indirect Predicates for Geometric Constructions. Comput. Aided Des. 126 (2020), 102856.
[3]
Marco Attene, Marcel Campen, and Leif Kobbelt. 2013. Polygon Mesh Repairing: An Application Perspective. ACM Comput. Surv. 45, 2 (2013), 1--33.
[4]
Marco Attene, Marco Livesu, Sylvain Lefebvre, Thomas Funkhouser, Szymon Rusinkiewicz, Stefano Ellero, Jonàs Martínez, and Amit Haim Bermano. 2018. Design, representations, and processing for additive manufacturing. Vol. 10. Springer.
[5]
Hichem Barki, Gaël Guennebaud, and Sebti Foufou. 2015. Exact, robust, and efficient regularized Booleans on general 3D meshes. Computers & Mathematics with Applications 70, 6 (2015), 1235--1254.
[6]
Amit H Bermano, Thomas Funkhouser, and Szymon Rusinkiewicz. 2017. State of the art in methods and representations for fabrication-aware design. Comput. Graph. Forum 36, 2 (2017), 509--535.
[7]
Gilbert Bernstein and Don Fussell. 2009. Fast, Exact, Linear Booleans. Comput. Graph. Forum 28, 5 (2009), 1269--1278.
[8]
Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno Lévy. 2010. Polygon mesh processing. CRC press.
[9]
Mario Botsch, Mark Pauly, Christian Rossl, Stephan Bischoff, and Leif Kobbelt. 2006. Geometric Modeling Based on Triangle Meshes. In ACM SIGGRAPH 2006 Courses (Boston, Massachusetts) (SIGGRAPH '06). 1--es.
[10]
Mario Botsch and Olga Sorkine. 2007. On linear variational surface deformation methods. IEEE. T. Vis. Comput. Gr. 14, 1 (2007), 213--230.
[11]
Hervé Brönnimann, Christoph Burnikel, and Sylvain Pion. 1998. Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. In Proc. Annu. Symp. Comput. Geom. (SCG '98). 165--174.
[12]
Hervé Brönnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra. 2024. 2D and 3D Linear Geometry Kernel. In CGAL User and Reference Manual (5.6.1 ed.). CGAL Editorial Board. https://doc.cgal.org/5.6.1/Manual/packages.html#PkgKernel23
[13]
Marcel Campen and Leif Kobbelt. 2010. Exact and Robust (Self-)Intersections for Polygonal Meshes. Comput. Graph. Forum 29, 2 (2010), 397--406.
[14]
Siu-Wing Cheng, Tamal Krishna Dey, Jonathan Shewchuk, and Sartaj Sahni. 2013. Delaunay mesh generation. CRC Press Boca Raton.
[15]
Gianmarco Cherchi, Marco Livesu, Riccardo Scateni, and Marco Attene. 2020. Fast and robust mesh arrangements using floating-point arithmetic. ACM Trans. Graph. 39, 6 (2020), 1--16.
[16]
Gianmarco Cherchi, Fabio Pellacini, Marco Attene, and Marco Livesu. 2022. Interactive and Robust Mesh Booleans. ACM Trans. Graph. 41, 6 (2022), 1--14.
[17]
Olivier Devillers, Sylvain Lazard, and William Lenhart. 2018. 3D Snap Rounding. In Proc. Annu. Symp. Comput. Geom. 1--14.
[18]
Olivier Devillers and Sylvain Pion. 2003. Efficient Exact Geometric Predicates for Delaunay Triangulations. Proc. 5th Workshop Algorithm Eng. Exper., 37--44.
[19]
Lorenzo Diazzi and Marco Attene. 2021. Convex polyhedral meshing for robust solid modeling. ACM Trans. Graph. 40, 6 (2021), 1--16.
[20]
Lorenzo Diazzi, Daniele Panozzo, Amir Vaxman, and Marco Attene. 2023. Constrained Delaunay Tetrahedrization: A Robust and Practical Approach. ACM Trans. Graph. 42, 6 (2023), 1--15.
[21]
Matthijs Douze, Jean-Sébastien Franco, and Bruno Raffin. 2017. QuickCSG: Fast Arbitrary Boolean Combinations of N Solids.
[22]
S Fortune. 1999. Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. Discrete & Computational Geometry 22, 4 (1999), 593--618.
[23]
Steven Fortune and Christopher J. Van Wyk. 1993. Efficient Exact Arithmetic for Computational Geometry. In Proc. Annu. Symp. Comput. Geom. (SCG '93). 163--172.
[24]
Steven Fortune and Christopher J. Van Wyk. 1996. Static analysis yields efficient exact integer arithmetic for computational geometry. ACM Trans. Graph. 15, 3 (1996), 223--248.
[25]
Michael Hemmer, Susan Hert, Sylvain Pion, and Stefan Schirra. 2023. Number Types. In CGAL User and Reference Manual (5.6 ed.). CGAL Editorial Board. https://doc.cgal.org/5.6/Manual/packages.html#PkgNumberTypes
[26]
Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, and Daniele Panozzo. 2018. Tetrahedral meshing in the wild. ACM Trans. Graph. 37, 4 (2018), 1--14.
[27]
Alec Jacobson, Daniele Panozzo, et al. 2018. libigl: A simple C++ geometry processing library. https://libigl.github.io/
[28]
Mioara Joldes, Olivier Marty, Jean-Michel Muller, and Valentina Popescu. 2016. Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions. IEEE Trans. Comput. 65, 4 (2016), 1197--1210.
[29]
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. (2019), 9593--9603.
[30]
David H. Laidlaw, W. Benjamin Trumbore, and John F. Hughes. 1986. Constructive Solid Geometry for Polyhedral Objects. SIGGRAPH Comput. Graph. 20, 4 (1986), 161--170.
[31]
Bruno Lévy. 2016. Robustness and efficiency of geometric programs: The Predicate Construction Kit (PCK). Comput. Aided Des. 72 (2016), 3--12.
[32]
M. Livesu, G. Cherchi, R. Scateni, and M. Attene. 2022. Deterministic Linear Time Constrained Triangulation using Simplified Earcut. IEEE. T. Vis. Comput. Gr. 28, 12 (2022), 5172--5177.
[33]
Marco Livesu, Stefano Ellero, Jonàs Martínez, Sylvain Lefebvre, and Marco Attene. 2017. From 3D models to 3D prints: an overview of the processing pipeline. Comput. Graph. Forum 36, 2 (2017), 537--564.
[34]
Pion Meyer. 2008. FPG A code generator for fast and certified geometric predicates. Real Numbers and Computers (2008).
[35]
Julius Nehring-Wirxel, Philip Trettner, and Leif Kobbelt. 2021. Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs. Comput. Aided Des. 135 (2021), 103015.
[36]
Sang C Park. 2004. Triangular mesh intersection. The Vis. Comput. 20 (2004), 448--456.
[37]
Bin Sheng, Bowen Liu, Ping Li, Hongbo Fu, Lizhuang Ma, and Enhua Wu. 2018. Accelerated robust Boolean operations based on hybrid representations. Comput. Aided Geom. Des. 62 (2018), 133--153.
[38]
Johnathan Richard Shewchuk. 1996. Robust Adaptive Floating-Point Geometric Predicates. Association for Computing Machinery, 141--150.
[39]
Jonathan Richard Shewchuk. 1997. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete Comput. Geom. 18, 3 (1997), 305--363.
[40]
Jonathan Richard Shewchuk and Brielin C. Brown. 2015. Fast segment insertion and incremental construction of constrained Delaunay triangulations. Computational Geometry 48, 8 (2015), 554--574.
[41]
Hang Si. 2015. TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator. ACM Trans. Math. Software 41, 2 (2015), 1--36.
[42]
Olga Sorkine. 2006. Differential representations for mesh processing. Comput. Graph. Forum 25, 4 (2006), 789--807.
[43]
Stratasys. 2024. GrabCAD. https://grabcad.com/library
[44]
Philip Trettner, Julius Nehring-Wirxel, and Leif Kobbelt. 2022. EMBER Exact Mesh Booleans via Efficient & Robust Local Arrangements. ACM Trans. Graph. 41, 4 (2022), 1--15.
[45]
Charlie C.L. Wang and Dinesh Manocha. 2013. Efficient Boundary Extraction of BSP Solids Based on Clipping Operations. IEEE. T. Vis. Comput. Gr. 19, 1 (2013), 16--29.
[46]
Weiming Wang, Tuanfeng Y. Wang, Zhouwang Yang, Ligang Liu, Xin Tong, Weihua Tong, Jiansong Deng, Falai Chen, and Xiuping Liu. 2013. Cost-effective Printing of 3D Objects with Skin-Frame Structures. ACM Trans. Graph. 32, 5 (2013), 1--10.
[47]
Z. Zheng, X. Gao, Z. Pan, W. Li, P. S. Wang, G. Wang, and K. Wu. 2024. Visual-Preserving Mesh Repair. IEEE Trans Vis Comput Graph PP (2024).
[48]
Qingnan Zhou, Eitan Grinspun, Denis Zorin, and Alec Jacobson. 2016. Mesh arrangements for solid geometry. ACM Trans. Graph. 35, 4 (2016), 1--15.
[49]
Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv preprint arXiv:1605.04797 (2016).
[50]
Afra Zomorodian and Herbert Edelsbrunner. 2000. Fast software for box intersections. In Proc. Annu. Symp. Comput. Geom. 129--138.
Index Terms
- Exact and Efficient Intersection Resolution for Mesh Arrangements
Recommendations
Fast and robust mesh arrangements using floating-point arithmetic
We introduce a novel algorithm to transform any generic set of triangles in 3D space into a well-formed simplicial complex. Intersecting elements in the input are correctly identified, subdivided, and connected to arrange a valid configuration, leading ...
Triangular mesh intersection
This paper proposes an efficient algorithm for finding self-intersections of a triangular mesh. It is very important to restrict, as much as possible, <i>when</i> and <i>where</i> the basic triangle-to-triangle intersection (TTI) algorithm is applied by ...
Robustness and efficiency of geometric programs
In this article, I focus on the robustness of geometric programs (e.g., Delaunay triangulation, intersection between surfacic or volumetric meshes, Voronoi-based meshing ) w.r.t. numerical degeneracies. Some of these geometric programs require "exotic" ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 19 November 2024
Published in TOG Volume 43, Issue 6
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 195Total Downloads
- Downloads (Last 12 months)195
- Downloads (Last 6 weeks)41
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in