On complexity of envelopes of piecewise linear functions, unions and intersections of polygons
Combinatorics
2013-11-27 v2 Metric Geometry
Abstract
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or upper) envelope of two continuous piecewise linear functions is considered.
Keywords
Cite
@article{arxiv.1301.4352,
title = {On complexity of envelopes of piecewise linear functions, unions and intersections of polygons},
author = {Pavel Kozhevnikov},
journal= {arXiv preprint arXiv:1301.4352},
year = {2013}
}
Comments
10 pages