Bounds on the size of tetrahedralizations

Bernard Chazelle, Nadia Shouraboura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

The paper presents an extension of the work of Bern on tetrahedralization, which is the triangulation of three dimensional polyhedra or the region between them. Attention is given on Steiner points which are additional vertices for nonconvex polyhedra to be tetrahedralized. A linear algorithm was given for the triangulation in the region between two polyhedra, and the region between a convex polyhedron and a disjoint polyhedral terrain. It was proven that any polyhedron of genus g must have at least g-1 reflex dihedral angles.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherPubl by ACM
Pages231-239
Number of pages9
ISBN (Print)0897916484, 9780897916486
DOIs
StatePublished - Jan 1 1994
EventProceedings of the 10th Annual Symposium on Computational Geometry - Stony Brook, NY, USA
Duration: Jun 6 1994Jun 8 1994

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Other

OtherProceedings of the 10th Annual Symposium on Computational Geometry
CityStony Brook, NY, USA
Period6/6/946/8/94

All Science Journal Classification (ASJC) codes

  • Software
  • Geometry and Topology
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

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

  • Cite this

    Chazelle, B., & Shouraboura, N. (1994). Bounds on the size of tetrahedralizations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 231-239). (Proceedings of the Annual Symposium on Computational Geometry). Publ by ACM. https://doi.org/10.1145/177424.177975