Elementary set operations with d-dimensional polyhedra
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
On the representation and manipulation of rigid solids
On the representation and manipulation of rigid solids
Introduction to algorithms
Oriented projective geometry
A rational rotation method for robust geometric algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Multidimensional binary search trees used for associative searching
Communications of the ACM
Proceedings of the sixth ACM symposium on Solid modeling and applications
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Proceedings of the 2005 ACM symposium on Solid and physical modeling
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An efficient local approach to convexity testing of piecewise-linear hypersurfaces
Computational Geometry: Theory and Applications
Contributing vertices-based Minkowski sum computation of convex polyhedra
Computer-Aided Design
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Contributing vertices-based Minkowski sum of a nonconvex--convex pair of polyhedra
ACM Transactions on Graphics (TOG)
Virtual interventions for image-based blood flow computation
Computer-Aided Design
Automata-Based symbolic representations of polyhedra
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operations. In consequence, they can represent non-manifold situations, open and closed sets, mixed-dimensional complexes, and they are closed under all boolean and topological operations, such as complement and boundary. They were introduced by W. Nef in his seminal 1978 book on polyhedra. The generality of Nef complexes is essential for some applications. In this paper, we present a new data structure for the boundary representation of three-dimensional Nef polyhedra and efficient algorithms for boolean operations. We use exact arithmetic to avoid well-known problems with floating-point arithmetic and handle all degeneracies. Furthermore, we present important optimizations for the algorithms, and evaluate this optimized implementation with extensive experiments. The experiments supplement the theoretical runtime analysis and illustrate the effectiveness of our optimizations. We compare our implementation with the Acis CAD kernel. Acis is mostly faster, by a factor up to six. There are examples on which Acis fails. The implementation was released as Open Source in the Computational Geometry Algorithm Library (Cgal) release 3.1 in December 2004.