Exact, robust, and efficient regularized Booleans on general 3D meshes
From MaRDI portal
Publication:2006434
DOI10.1016/j.camwa.2015.06.016zbMath1443.65023OpenAlexW1152513078MaRDI QIDQ2006434
Hichem Barki, Sebti Foufou, Gaël Guennebaud
Publication date: 11 October 2020
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2015.06.016
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Polyhedral manifolds (52B70)
Related Items
Accelerated robust Boolean operations based on hybrid representations ⋮ Algorithm for three-dimensional curved block cutting analysis in solid modeling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The nature and meaning of perturbations in geometric computing
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Practical volumetric sculpting
This page was built for publication: Exact, robust, and efficient regularized Booleans on general 3D meshes