Bounds on the size of tetrahedralizations

B. Chazelle, N. Shourboura

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)429-444
Number of pages16
JournalDiscrete & Computational Geometry
Issue number1
StatePublished - Dec 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Bounds on the size of tetrahedralizations'. Together they form a unique fingerprint.

Cite this