Exact Fast Parallel Intersection of Large 3-D Triangular Meshes

DOI10.1007/978-3-030-13992-6_20MaRDI QIDQ3296633zbMATH OpenOpenAlexFDO

Authors Salles Viana Gomes de Magalhães, Marcus Vinícius Alvim Andrade, William Randolph Franklin

Publication date 30 June 2020

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-13992-6_20

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Cites work

• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• An intersection-sensitive algorithm for snap rounding
• Area and perimeter computation of the union of a set of iso-rectangles in parallel
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Classroom examples of robustness problems in geometric computations
• Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
• scientific article; zbMATH DE number 4123136 (Why is no real title available?)
• Mesh Generation
• Practical segment intersection with finite precision output
• Reliable and Efficient Computational Geometry Via Controlled Perturbation
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Stable snap rounding

Cited in

(2)

• Exact, robust, and efficient regularized Booleans on general 3D meshes
• MeshIntersection

Describes a project that uses

Uses Software

• CGAL
• Gmsh
• Metro
• Tcmalloc
• libigl
• SFCGAL
• GitHub

This page was built for publication: Exact Fast Parallel Intersection of Large 3-D Triangular Meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296633)