Fast and robust Booleans on polyhedra
Authors:
- Songgang XuSXSonggang Xu
- John KeyserJKJohn Keyser
- 1 February 2013
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 45 (2) , 529-534
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Exact and Robust (Self‐)Intersections for Polygonal MeshesComputer Graphics Forum, 2010
- Fast, Exact, Linear BooleansComputer Graphics Forum, 2009
- 3D collision detection: a surveyComputers & Graphics, 2001
- Robustness in Geometric Computations*Journal of Computing and Information Science in Engineering, 2001
- Topology-Oriented Implementation--An Approach to Robust Geometric AlgorithmsAlgorithmica, 2000
- Polyhedral modelling with multiprecision integer arithmeticComputer-Aided Design, 1997
- Efficient exact arithmetic for computational geometry1993
- Merging BSP trees yields polyhedral set operationsACM SIGGRAPH Computer Graphics, 1990
- Robust set operations on polyhedral solidsIEEE Computer Graphics and Applications, 1989
- Boolean operations in solid modeling: Boundary evaluation and merging algorithmsProceedings of the IEEE, 1985