Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments
- 30 September 2007
- journal article
- Published by Elsevier BV in Computational Geometry
- Vol. 38 (1-2), 64-99
- https://doi.org/10.1016/j.comgeo.2006.11.009
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Robust Geometric Computing in MotionThe International Journal of Robotics Research, 2002
- Shortest Path Geometric RoundingAlgorithmica, 2000
- Set-combinations of the mixed-dimension cellular objects of the Djinn APIComputer-Aided Design, 1999
- Using generic programming for designing a data structure for polyhedral surfacesComputational Geometry, 1999
- Polyhedral modelling with multiprecision integer arithmeticComputer-Aided Design, 1997
- Towards exact geometric computationComputational Geometry, 1997
- Topologically exact evaluation of polyhedra defined in CSG with loose primitivesComputer Graphics Forum, 1996
- A Paradigm for the Robust Design of Algorithms for Geometric ModelingComputer Graphics Forum, 1994
- An introduction to solid modellingComputers & Graphics, 1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975