Journal ArticleOPEN ACCESS

Bounds on the size of tetrahedralizations

Discrete & Computational Geometry (1995) 14(1) 429-444
DOI: 10.1007/BF02570716
8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 1995 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Chazelle, B., & Shourboura, N. (1995). Bounds on the size of tetrahedralizations. Discrete & Computational Geometry, 14(1), 429–444. https://doi.org/10.1007/BF02570716

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free