Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra

Abstract

We give a worst-case bound of e(m2/3n 2/3 -tn) on the complexity of m convex polygons whose sides come from n lines. The same bound applies to the complexity of the horizon of a scgment that intersects m faces in an incrementally-constructed erased arrangement of n lines. Wc also show that Cha~eUe's notch-cutting procedure, when applied to a polyhedron with… (More)
DOI: 10.1007/3-540-55706-7_34

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Hershberger1992ConvexPM, title={Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra}, author={John Hershberger and Jack Snoeyink}, booktitle={SWAT}, year={1992} }