Bounds on the size of tetrahedralizations

Bernard Chazelle, N. Shourboura

Research output: Contribution to journalArticle

8 Scopus citations

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.

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

All Science Journal Classification (ASJC) codes

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

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

  • Cite this