Abstract
This paper gives lower and upper bounds on the complexity of triangulating the region between polyhedra. Particular attention is given to the case of convex polyhedra and terrains.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aronov, B., Sharir, M. Triangles in space or building (and analyzing) castles in the air.Combinatorica 10 (1990), 137–173.
Aronov, B., Sharir, M. Castles in the air revisited,Proceedings of the 8th Annual ACM Symposium on Computational Geometry, 1992, pp. 146–156.
Aronov, B., Sharir, M. The union of convex polyhedra in three dimensions,Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 1993, pp. 518–527.
Bajaj, C. L., Dey, T. K. Convex Decompositions of Polyhedra and Rubustness,SIAM Journal on Computing 21 (1992), 339–364.
Bern, M. Compatible tetrahedralizations,Proceedings of the 9th Annual ACM Symposium on Computational Geometry, 1993, pp. 281–288.
Chazelle, B. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm,SIAM Journal on Computing 13 (1984), 488–507.
Chazelle, B. An optimal algorithm for intersecting three-dimensional convex polyhedra,SIAM Journal on Computing 21 (1992), 671–696.
Chazelle, B., Palios, L. Triangulating a nonconvex polytope,Discrete & Computational Geometry 5 (1990), 505–526.
Dey, T. K. Triangulation and CSG representation of polyhedra with arbitrary genus,Proceedings of the 7th Annual ACM Symposium on Computational Geometry, 1991, pp. 364–372.
Dobkin, D. P., Kirkpatrick, D. G. Fast detection of polyhedral intersection,Theoretical Computer Science 27 (1983), 241–253.
Dobkin, D. P., Laszlo, M. J. Primitives for the manipulation of three-dimensional subdivisions,Algorithmica 4 (1989), 3–32.
Martin, A. A simple primal algorithm for intersecting 3-polyhedra in linear time, Tech. Report 91-16, University of British Columbia, Vancouver, July 1991.
Mehlhorn, K.Data Structures and Algorithms, 3: Multidimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
Mulmuley, K.Computational Geometry: An Introduction Through Randomized Algorithms Prentice-Hall, Englewood Cliffs, NJ, 1994.
Pellegrini, M. Building convex space partitions induced by pairwise interior-disjoint simplices, ICSI TR-93-039, Berkeley, CA, Aug. 1993.
Ruppert, J., Seidel, R. On the difficulty of triangulating three-dimensional nonconvex polyhedra,Discrete & Computational Geometry 7 (1992), 227–253.
Schönhardt, E. Über die Zerlegung von Dreieckspolyedern in Tetraeder,Mathematische Annalen 98 (1928), 309–312.
Author information
Authors and Affiliations
Additional information
The first author was suported in part by NSF Grant CCR-90-02352 and The Geometry Center, University of Minnesota, an STC funded by NSF, DOE, and Minnesota Technology, Inc. The second author was supported in part by NSF Grant PHY-90-21984.
Rights and permissions
About this article
Cite this article
Chazelle, B., Shourboura, N. Bounds on the size of tetrahedralizations. Discrete & Computational Geometry 14, 429–444 (1995). https://doi.org/10.1007/BF02570716
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02570716