Constructive solid geometry for polyhedral objects
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
SCG '87 Proceedings of the third annual symposium on Computational geometry
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
A solid modelling system free from topological inconsistency
Journal of Information Processing
SCULPT: an interactive solid modeling tool
Proceedings on Graphics interface '90
Using tolerances to guarantee valid polyhedral modeling results
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Sculpting: an interactive volumetric modeling technique
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Kizamu: a system for sculpting digital characters
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Robust Set Operations on Polyhedral Solids
IEEE Computer Graphics and Applications
The Nature and Meaning of Perturbations in Geometric Computing
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Improved Binary Space Partition merging
Computer-Aided Design
Liquid simulation with mesh-based surface tracking
ACM SIGGRAPH 2011 Courses
Technical note: Fast and robust Booleans on polyhedra
Computer-Aided Design
SMI 2013: Shape grammars on convex polyhedra
Computers and Graphics
| Hi-index | 0.00 |
We present a new system for robustly performing Boolean operations on linear, 3D polyhedra. Our system is exact, meaning that all internal numeric predicates are exactly decided in the sense of exact geometric computation. Our BSP-tree based system is 16--28x faster at performing iterative computations than CGAL's Nef Polyhedra based system, the current best practice in robust Boolean operations, while being only twice as slow as the non-robust modeler Maya. Meanwhile, we achieve a much smaller substrate of geometric subroutines than previous work, comprised of only 4 predicates, a convex polygon constructor, and a convex polygon splitting routine. The use of a BSP-tree based Boolean algorithm atop this substrate allows us to explicitly handle all geometric degeneracies without treating a large number of cases.