Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Exact Fast Parallel Intersection of Large 3-D Triangular Meshes

  • Chapter
  • First Online:
27th International Meshing Roundtable (IMR 2018)

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 127))

Included in the following conference series:

Abstract

We present 3D-EPUG-Overlay, a fast, exact, parallel, memory-efficient, algorithm for computing the intersection between two large 3-D triangular meshes with geometric degeneracies. Applications include CAD/CAM, CFD, GIS, and additive manufacturing. 3D-EPUG-Overlay combines five separate techniques: multiple precision rational numbers to eliminate roundoff errors during the computations; Simulation of Simplicity to properly handle geometric degeneracies; simple data representations and only local topological information to simplify the correct processing of the data and make the algorithm more parallelizable; a uniform grid to efficiently index the data, and accelerate testing pairs of triangles for intersection or locating points in the mesh; and parallel programming to exploit current hardware. 3D-EPUG-Overlay is up to 101 times faster than LibiGL, and comparable to QuickCSG, a parallel inexact algorithm. 3D-EPUG-Overlay is also more memory efficient. In all test cases 3D-EPUG-Overlay’s result matched the reference solution. It is freely available for nonprofit research and education at https://github.com/sallesviana/MeshIntersection.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. V. Akman, W.R. Franklin, M. Kankanhalli, C. Narayanaswami, Geometric computing and the uniform grid data technique. Comput. Aided Des. 21(7), 410–420 (1989)

    Article  Google Scholar 

  2. A. Belussi, S. Migliorini, M. Negri, G. Pelagatti, Snap rounding with restore: an algorithm for producing robust geometric datasets. ACM Trans. Spatial Algoritm. Syst. 2(1), 1:1–1:36 (2016)

    Article  Google Scholar 

  3. G. Bernstein, D. Fussell, Fast, exact, linear booleans. Eurographics Symp. Geom. Process. 28(5), 1269–1278 (2009)

    Google Scholar 

  4. Cgal, Computational Geometry Algorithms Library. https://www.cgal.org. Retrieved Sept 2018

  5. P. Cignoni, C. Rocchini, R. Scopigno, Metro: measuring error on simplified surfaces. Comput. Graphics Forum 17(2), 167–174 (1998)

    Article  Google Scholar 

  6. M. de Berg, D. Halperin, M. Overmars, An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3), 159–165 (2007)

    Article  MathSciNet  Google Scholar 

  7. S.V.G. de Magalhães, Exact and parallel intersection of 3D triangular meshes, Ph.D. thesis, Rensselaer Polytechnic Institute, 2017

    Google Scholar 

  8. S.V.G. de Magalhães, W.R. Franklin, M.V.A. Andrade, W. Li, An efficient algorithm for computing the exact overlay of triangulations, in 25th Fall Workshop on Computational Geometry, U. Buffalo, New York, USA, 23–24 Oct 2015 (2015). Extended abstract

    Google Scholar 

  9. M. Douze, J.-S. Franco, B. Raffin, QuickCSG: arbitrary and faster boolean combinations of n solids, Ph.D. thesis, Inria-Research Centre, Grenoble–Rhône-Alpes, France, 2015

    Google Scholar 

  10. H. Edelsbrunner, E.P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM TOG 9(1), 66–104 (1990)

    Article  Google Scholar 

  11. F. Feito, C. Ogayar, R. Segura, M. Rivero, Fast and accurate evaluation of regularized boolean operations on triangulated solids. Comput. Aided Des. 45(3), 705–716 (2013)

    Article  Google Scholar 

  12. W.R. Franklin, Efficient polyhedron intersection and union, in Proceedings of Graphics Interface, pp. 73–80, Toronto (1982)

    Google Scholar 

  13. W.R. Franklin, Adaptive grids for geometric operations. Cartographica 21(2–3), 161–167, Summer – Autumn (1984). Monograph 32–33

    Google Scholar 

  14. W.R. Franklin, Polygon properties calculated from the vertex neighborhoods, in Proceedings of 3rd Annual ACM Symposium on Computational Geometry, pp. 110–118 (1987)

    Google Scholar 

  15. W.R. Franklin, S.V.G. Magalhães, Parallel intersection detection in massive sets of cubes, in Proceedings of BigSpatial’ 17: 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data, Los Angeles Area, CA, USA, 7–10 Nov 2017 (2017)

    Google Scholar 

  16. W.R. Franklin, N. Chandrasekhar, M. Kankanhalli, M. Seshan, V. Akman, Efficiency of uniform grids for intersection detection on serial and parallel machines, in New Trends in Computer Graphics (Proc. Computer Graphics International’88), ed. by N. Magnenat-Thalmann, D. Thalmann, pp. 288–297 (Springer, Berlin, 1988)

    Chapter  Google Scholar 

  17. W.R. Franklin, C. Narayanaswami, M. Kankanhalli, D. Sun, M.-C. Zhou, P. Y. Wu, Uniform grids: a technique for intersection detection on serial and parallel machines, in Proceedings of Auto Carto 9: Ninth International Symposium on Computer-Assisted Cartography, pp. 100–109, Baltimore, Maryland, 2–7 April 1989 (1989)

    Google Scholar 

  18. P.J. Frey, P. George, Mesh Generation: Application to Finite Elements, Second Edition (ISTE Ltd./Wiley, London/Hoboken, 2010)

    Google Scholar 

  19. C. Geuzaine, J.-F. Remacle, Gmsh: a 3-d finite element mesh generator with built-in pre-and post-processing facilities. Int. J. Numer. Methods Eng. 79(11), 1309–1331 (2009)

    Article  MathSciNet  Google Scholar 

  20. S. Ghemawat, P. Menage, TCMalloc: thread-caching malloc (15 Nov 2015), http://goog-perftools.sourceforge.net/doc/tcmalloc.html. Retrieved on 13 Nov 2016

  21. P. Hachenberger, L. Kettner, K. Mehlhorn, Boolean operations on 3d selective nef complexes: data structure, algorithms, optimized implementation and experiments. Comupt. Geom. 38(1), 64–99 (2007)

    Article  MathSciNet  Google Scholar 

  22. D. Hedin, W.R. Franklin, NearptD: a parallel implementation of exact nearest neighbor search using a uniform grid, in Canadian Conference on Computational Geometry, Vancouver Canada (Aug. 2016)

    Google Scholar 

  23. J. Hershberger, Stable snap rounding. Comput. Geom. 46(4), 403–416 (2013)

    Article  MathSciNet  Google Scholar 

  24. J.D. Hobby, Practical segment intersection with finite precision output. Comput. Geom. 13(4), 199–214 (1999)

    Article  MathSciNet  Google Scholar 

  25. A. Jacobson, D. Panozzo, et al., libigl: A Simple C++ Geometry Processing Library (2016), http://libigl.github.io/libigl/. Retrieved on 18 Oct 2017

  26. M. Kankanhalli, W.R. Franklin, Area and perimeter computation of the union of a set of iso-rectangles in parallel. J. Parallel Distrib. Comput. 27(2), 107–117 (1995)

    Article  Google Scholar 

  27. L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, C. Yap, Classroom examples of robustness problems in geometric computations. Comput. Geom. Theory Appl. 40(1), 61–78 (2008)

    Article  MathSciNet  Google Scholar 

  28. C. Leconte, H. Barki, F. Dupont, 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 (Oct. 2010). Retrieved on 19 Oct 2017

    Google Scholar 

  29. C. Li, Exact geometric computation: theory and applications, Ph.D. thesis, Department of Computer Science, Courant Institute - New York University, January 2001

    Google Scholar 

  30. S.V.G. Magalhães, M.V.A. Andrade, W.R. Franklin, W. Li, Fast exact parallel map overlay using a two-level uniform grid, in 4th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data (BigSpatial), Bellevue WA USA, 3 Nov 2015

    Google Scholar 

  31. S.V.G. Magalhães, M.V.A. Andrade, W.R. Franklin, W. Li, PinMesh – fast and exact 3D point location queries using a uniform grid. Comput. Graph. J. 58, 1–11 (2016). Special issue on Shape Modeling International 2016 (online 17 May). Awarded a reproducibility stamp, http://www.reproducibilitystamp.com/

  32. S.V.G. Magalhães, M.V.A. Andrade, W.R. Franklin, W. Li, M.G. Gruppi, Exact intersection of 3D geometric models, in Geoinfo 2016, XVII Brazilian Symposium on GeoInformatics, Campos do Jordão, SP, Brazil (Nov. 2016)

    Google Scholar 

  33. D.J. Meagher, Geometric modelling using octree encoding. Comput. Graphics Image Process. 19, 129–147 (1982)

    Article  Google Scholar 

  34. K. Mehlhorn, R. Osbild, M. Sagraloff, Reliable and efficient computational geometry via controlled perturbation, in ICALP (1), ed. by M. Bugliesi, B. Preneel, V. Sassone, I. Wegener. Lecture Notes in Computer Science, vol. 4051, pp. 299–310 (Springer, Berlin, 2006)

    Chapter  Google Scholar 

  35. G. Mei, J.C. Tipper, Simple and robust boolean operations for triangulated surfaces. CoRR, abs/1308.4434 (2013)

    Google Scholar 

  36. Oslandia, IGN, SFCGAL, 2017, http://www.sfcgal.org/. Retrieved on 19 Oct 2017

  37. D. Pavić, M. Campen, L. Kobbelt, Hybrid booleans. Comput. Graph. Forum 29(1), 75–87 (2010)

    Article  Google Scholar 

  38. S. Pion, A. Fabri, A generic lazy evaluation scheme for exact geometric computations. Sci. Comput. Program. 76(4), 307–323 (2011)

    Article  Google Scholar 

  39. J.R. Shewchuk, Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discret. Comput. Geom. 18(3), 305–363 (1997)

    Article  MathSciNet  Google Scholar 

  40. C.K. Yap, Symbolic treatment of geometric degeneracies, in System Modelling and Optimization: Proceedings of 13th IFIP Conference, ed. by M. Iri, K. Yajima, pp. 348–358 (Springer, Berlin, 1988)

    Google Scholar 

  41. J. Yongbin, W. Liguan, B. Lin, C. Jianhong, Boolean operations on polygonal meshes using obb trees, in ESIAT 2009, vol. 1, pp. 619–622 (IEEE, Piscataway, 2009)

    Google Scholar 

  42. Q. Zhou, E. Grinspun, D. Zorin, A. Jacobson, Mesh arrangements for solid geometry. ACM Trans. Graph. 35(4), 39:1–39:15 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal de Viçosa (MG), Viçosa, Brasil

    Salles Viana Gomes de Magalhães & Marcus Vinícius Alvim Andrade

  2. ECSE Department, Rensselaer Polytechnic Institute, Troy, NY, USA

    W. Randolph Franklin

Authors
  1. Salles Viana Gomes de Magalhães
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Randolph Franklin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcus Vinícius Alvim Andrade
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to W. Randolph Franklin .

Editor information

Editors and Affiliations

  1. Barcelona Supercomputing Center, Mataró, Barcelona, Spain

    Xevi Roca

  2. Inria, Palaiseau, France

    Adrien Loseille

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

de Magalhães, S.V.G., Randolph Franklin, W., Andrade, M.V.A. (2019). Exact Fast Parallel Intersection of Large 3-D Triangular Meshes. In: Roca, X., Loseille, A. (eds) 27th International Meshing Roundtable. IMR 2018. Lecture Notes in Computational Science and Engineering, vol 127. Springer, Cham. https://doi.org/10.1007/978-3-030-13992-6_20

Download citation

Publish with us

Policies and ethics

Search

Navigation