@inproceedings{d3ecc068781a4ac28e9d19db0411a69a,

title = "Bounds on the size of tetrahedralizations",

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.",

author = "Bernard Chazelle and Nadia Shouraboura",

year = "1994",

doi = "10.1145/177424.177975",

language = "English (US)",

isbn = "0897916484",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Publ by ACM",

pages = "231--239",

booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

note = "Proceedings of the 10th Annual Symposium on Computational Geometry ; Conference date: 06-06-1994 Through 08-06-1994",

}