Salles V. G. Magalhães
ABSTRACT
We present an algorithm to compute the intersection of two 3D triangulated meshes. It has applications in GIS, CAD and Additive Manufacturing, and was developed to process big datasets quickly and correctly. The speed comes from simple regular data structures that parallelize very well. The correctness comes from using multiple-precision rational arithmetic to prevent roundoff errors and the resulting topological inconsistencies, and symbolic perturbation (simulation of simplicity) to handle special cases (geometric degeneracies). To simplify the symbolic perturbation, the algorithm employs only orientation predicates. This paper focuses on the challenges and solutions of the implementing symbolic perturbation. Our preliminary implementation has intersected two objects totalling 8M triangles in 11 elapsed seconds on a dual 8-core Xeon. The competing LibiGL took 248 seconds and CGAL took 2726 seconds. Our software is freely available for nonprofit research.
- AIM@SHAPE-VISIONAIR Shape Repository 2017. AIM@SHAPE-VISIONAIR Shape Repository. http://visionair.ge.imati.cnr.it// (accessed on Jun-2017). (2017).Google Scholar
- V. Akman, Wm. Randolph Franklin, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. 1989. Geometric Computing and the Uniform Grid Data Technique. Comput. Aided Design 21, 7 (1989), 410--420. Google ScholarDigital Library
- Hichem Barki, Gael Guennebaud, and Sebti Foufou. 2015. Exact, robust, and efficient regularized Booleans on general 3D meshes. Computers & Mathematics with Applications 70, 6 (2015), 1235--1254. Google ScholarDigital Library
- Gilbert Bernstein and Don Fussell. 2009. Fast, exact, linear booleans. Eurographics Symposium on Geometry Processing 28, 5 (2009), 1269--1278. Google ScholarDigital Library
- CGAL 2016. Cgal, Computational Geometry Algorithms Library. (2016). http://www.cgal.org (accessed on Apr-2017).Google Scholar
- Paolo Cignoni, Claudio Rocchini, and Roberto Scopigno. 1998. Metro: Measuring error on simplified surfaces. In Computer Graphics Forum, Vol. 17. Wiley Online Library, 167--174.Google Scholar
- Matthijs Douze, Jean-Sébastien Franco, and Bruno Raffin. 2015. QuickCSG: Arbitrary and faster boolean combinations of n solids. Ph.D. Dissertation. Inria-Research Centre Grenoble--Rhône-Alpes; INRIA.Google Scholar
- David Eberly. 2008. Triangulation by ear clipping. Geometric Tools (2008).Google Scholar
- Herbert Edelsbrunner and Ernst Peter Mücke. 1990. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics (TOG) 9, 1 (1990), 66--104. Google ScholarDigital Library
- F.R. Feito, C.J. Ogayar, R.J. Segura, and M.L. Rivero. 2013. Fast and accurate evaluation of regularized Boolean operations on triangulated solids. Computer-Aided Design 45, 3 (2013), 705--716. Google ScholarDigital Library
- Wm. Randolph Franklin, Narayanaswami Chandrasekhar, Mohan Kankanhalli, Manoj Seshan, and Varol Akman. 1988. Efficiency of uniform grids for intersection detection on serial and parallel machines. In New Trends in Computer Graphics (Proc. Computer Graphics International'88), Nadia Magnenat-Thalmann and D. Thalmann (Eds.). Springer-Verlag, 288--297.Google Scholar
- Peter Hachenberger, Lutz Kettner, and Kurt Mehlhorn. 2007. Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Computational Geometry 38, 1 (2007), 64--99. Google ScholarDigital Library
- X.Y. Jiang and H. Bunke. 1993. An optimal algorithm for extracting the regions of a plane graph. Pattern Recognition Letters 14, 7 (1993), 553--558. Google ScholarDigital Library
- Cyril Leconte, Hichem Barki, and Florent Dupont. 2010. Exact and Efficient Booleans for Polyhedra. Technical Report RR-LIRIS-2010-018. LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon 2/École Centrale de Lyon. http://liris.cnrs.fr/publis/?id=4883Google Scholar
- Salles V.G. Magalhães, Marcus V.A. Andrade, W Randolph Franklin, and Wenli Li. 2016. PinMesh - Fast and exact 3D point location queries using a uniform grid. Computers & Graphics 58 (2016), 1--11. Shape Modeling International 2016. Google ScholarDigital Library
- Salles V. G. Magalhães, Marcus V. A. A. Andrade, W Randolph Franklin, and Wenli Li. 2015. Fast exact parallel map overlay using a two-level uniform grid. In Proc. of the 4th ACM Bigspatial (BigSpatial '15). ACM, New York, NY, USA. Google ScholarDigital Library
- Salles V. G. Magalhães, Marcus V. A. A. Andrade, W Randolph Franklin, Wenli Li, and Maurıcio G. Gruppi. 2016. Exact intersection of 3D geometric models. In Proc. of XVII Brazilian Symposium on Geoinformatics (GeoInfo '16). 44--55.Google Scholar
- Rafael Jesus Segura and Francisco R. Feito. 2001. Algorithms to Test Ray-Triangle Intersection. Comparative Study. In The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2001. 76--81.Google Scholar
- SFCGAL 2017. SFCGAL. (2017). http://www.sfcgal.org/ (accessed on Jun-2017).Google Scholar
- Chee-Keng Yap. 1988. Symbolic treatment of geometric degeneracies. Springer Berlin Heidelberg, Berlin, Heidelberg, 348--358.Google Scholar
- Qingnan Zhou, Eitan Grinspun, Denis Zorin, and Alec Jacobson. 2016. Mesh Arrangements for Solid Geometry. ACM Transactions on Graphics (TOG) 35, 4 (2016). Google ScholarDigital Library
- Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv preprint arXiv:1605.04797 (2016).Google Scholar
Index Terms
- Fast exact parallel 3D mesh intersection algorithm using only orientation predicates
Recommendations
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 ...
Delaunay refinement algorithms for triangular mesh generation
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed ...
Efficient parallel geometric algorithms on a mesh of trees
ACM-SE 33: Proceedings of the 33rd annual on Southeast regional conferenceIn this paper, we present some efficient parallel geometric algorithms for computing the All Nearest Neighbors, Delaunay Triangulation, Convex Hull, and Voronoi Diagram of a point set S with N points in the plane. The algorithm of All Nearest Neighbors ...
Comments