Abstract
In this paper, we present an algorithm to tetrahedralize the region between two nested convex polyhedra without introducing Steiner points. The resulting tetrahedralization consists of linear number of tetrahedra. Thus, we answer the open problem raised by Chazelle and Shouraboura [6]: “whether or not one can tetrahedralize the region between two nested convex polyhedra into linear number of tetrahedra, avoiding Steiner points?”. Our algorithm runs in O((n+m)3 log(n+m)) time and produces 2(m+n-3) tetrahedra, where n and m are the numbers of the vertices in the two given polyhedra, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Avis and H. ElGindy, Triangulating point sets in space, Discrete and Computational Geometry, 2(1987)99–111.
M. Bern, Compatible tetrahedralizations, In Proc. 9th ACM Symp. Computational Geometry 281–288, 1993.
M. Bern and D. Eppstein, Mesh generation and optimal triangulation, In Computing in Euclidean Geometry, (D. Du and F. Hwangeds.), World Scientific Publishing Co. 1992.
B. Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM J. Computing, 13(1984)488–507.
B.Chazelle and L. Palios, Triangulating a nonconvex polytope, Discrete and computational geometry, 5(1990)505–526.
B. Chazelle and N. Shouraboura, Bounds on the size of tetrahedralizations, In Proc. 10th ACM Symp. Computational Geometry, 231–239, 1994.
H. Edelsbrunner, F. Preparata, and D. West, Tetrahedralizing point sets in three dimensions, Journal of Symbolic Computation, 10(1990)335–347.
J. Goodman and J. Pach, Cell Decomposition of Polytopes by Bending, Israel J. of Math, 64(1988)129–138.
J. Goodman and J. O’Rourke, Handbook of Discrete and Computational Geometry, CRC Press, New York, 1997.
J. Rupert and R. Seidel, On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra, Discrete and Computational Geometry, 7(1992)227–253.
E. Schonhardt, Uber die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Annalen 98(1928)309–312.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, C.A., Yang, B. (2000). Tetrahedralization of Two Nested Convex Polyhedra. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive