Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
From MaRDI portal
Publication:3296633
DOI10.1007/978-3-030-13992-6_20OpenAlexW2953962277MaRDI QIDQ3296633
Marcus Vinícius Alvim Andrade, Salles Viana Gomes de Magalhães, 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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- An intersection-sensitive algorithm for snap rounding
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Practical segment intersection with finite precision output
- Area and perimeter computation of the union of a set of iso-rectangles in parallel
- Stable snap rounding
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- Classroom examples of robustness problems in geometric computations
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Mesh Generation
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
This page was built for publication: Exact Fast Parallel Intersection of Large 3-D Triangular Meshes