An efficient and exact parallel algorithm for intersecting large 3-D triangular meshes using arithmetic filters
Abstract We present 3 D-EPUG-Overlay, a fast, exact, parallel, memory-efficient, algorithm
for computing the intersection between two large 3-D triangular meshes with geometric …
for computing the intersection between two large 3-D triangular meshes with geometric …
Fast exact parallel 3D mesh intersection algorithm using only orientation predicates
SVG Magalhães, WR Franklin… - Proceedings of the 25th …, 2017 - dl.acm.org
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 …
applications in GIS, CAD and Additive Manufacturing, and was developed to process big …
Exact fast parallel intersection of large 3-D triangular meshes
SVG de Magalhães, W Randolph Franklin… - … Meshing Roundtable 27, 2019 - Springer
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 …
computing the intersection between two large 3-D triangular meshes with geometric …
Data Structures for Parallel Spatial Algorithms on Large Datasets (Vision paper)
WR Franklin, SVG de Magalhães… - Proceedings of the 7th …, 2018 - dl.acm.org
This paper describes data structures and algorithms for efficient implementation of GIS
operations for large datasets on multicore Intel CPUs and on NVIDA GPUs. Typical …
operations for large datasets on multicore Intel CPUs and on NVIDA GPUs. Typical …
Minimal representations of polygons and polyhedra
W Randolph Franklin, SVG de Magalhães - Spatial Gems, Volume 1, 2022 - dl.acm.org
This gem presents several different data structures to represent a geometric object. They
facilitate efficient parallel computation of mass properties, especially when the object is the …
facilitate efficient parallel computation of mass properties, especially when the object is the …
[PDF][PDF] Computing intersection areas of overlaid 2D meshes
WR Franklin, SVG de Magalhães - IGS2019 International Geometry …, 2019 - wrfranklin.org
Parover2 is a parallel algorithm and preliminary implementation to compute the area of
every nonempty intersection of any face of one 2D mesh with any face from another mesh …
every nonempty intersection of any face of one 2D mesh with any face from another mesh …
[PDF][PDF] Exact fast parallel intersection of large 3-D triangular meshes
ABSTRACT We present 3D-EPUG-Overlay, a fast, exact, parallel, memoryefficient, algorithm
for computing the intersection between two large 3-D triangular meshes with geometric …
for computing the intersection between two large 3-D triangular meshes with geometric …