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
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
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
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
| 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(nlogn) tetrahedra and no Steiner points.