The Common Exterior of Convex Polygons in the Plane

Abstract We establish several combinatorial bounds on the complexity (number of vertices and edges) of the complement of the union (also known as the common exterior) of k convex polygons in the plane, with a total of n edges. We show: 1. (1) The maximum complexity of the entire common exterior is Θ(nα(k) + k 2 ). 2 2. (2) The maximum complexity of a single cell of the common exterior is Θ(nα(k)). 3. (3) The complexity of m distinct cells in the common exterior is O (m 2 3 k 2 3 log 1 3 ( k 2 m ) + n log k) and can be Ω(m 2 3 k 2 3 + nα(k)) in the worst case.

[1]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[2]  Gyula O. H. Katona.  On a problem of L. Fejes Tóth , 1977 .

[3]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[4]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[5]  Micha Sharir,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, Discret. Comput. Geom..

[6]  Herbert Edelsbrunner,et al.  On the maximal number of edges of many faces in an arrangement , 1986, J. Comb. Theory, Ser. A.

[7]  The Complexity of Many Faces in the Overlay of Arrangements , 1995 .

[8]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

[9]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[10]  M. Sharir,et al.  Improved bounds on the complexity of many faces in arrangements of segments , 1992 .

[11]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[12]  Leonidas J. Guibas,et al.  The number of edges of many faces in a line segment arrangement , 1992, Comb..

[13]  Jean-Daniel Boissonnat,et al.  An optimal algorithm for the boundary of a cell in a union of rays , 1988, Geometry and Robotics.

[14]  Jirí Matousek.  Construction of ɛ-nets , 1990, Discret. Comput. Geom..

[15]  Jon M. Kleinberg,et al.  Voronoi Diagrams of Rigidly Moving Sets of Points , 1992, Inf. Process. Lett..

[16]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.