.png){kind=icon}
.png){kind=icon}
Return
An Efficient and Exact Parallel Algorithm for Intersecting Large 3-D Triangular Meshes Using Arithmetic Filters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2019.102801.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 5 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. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Boolean operations
Parallel programming
Exact computation
Polyhedron intersection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K