Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm
SIAM Journal on Computing
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Triangulating a nonconvex polytope
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Tetrahedrizing point sets in three dimensions
Journal of Symbolic Computation
On the difficulty of triangulating three-dimensional nonconvex polyhedra.
Discrete & Computational Geometry
An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An incremental algorithm for Betti numbers of simplicial complexes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Fast Detection of Polyhedral Intersections
Proceedings of the 9th Colloquium on Automata, Languages and Programming
An incremental algorithm for Betti numbers of simplicial complexes
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Bounds on the size of tetrahedralizations
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Stabbing triangulations by lines in 3D
Proceedings of the eleventh annual symposium on Computational geometry
Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
Linear complexity hexahedral mesh generation
Proceedings of the twelfth annual symposium on Computational geometry
Tetrahedralization of Two Nested Convex Polyhedra
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We give some special-case tetrahedralization algorithms. We first consider the problem of finding a tetrahedralization compatible with a fixed triangulation of the boundary of a polyhedron. We then adapt our solution to the related problem of compatibly tetrahedralizing the interior and exterior of a polyhedron. We also show how to tetrahedralize the region between nested convex polyhedra with O(n log n) tetrahedra and no Steiner points.