On complexity of envelopes of piecewise linear functions, unions and intersections of polygons
classification
🧮 math.CO
math.MG
keywords
functionslinearpiecewisepolygonssimpleupperverticesbounds
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.