Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into open convex cells whose dual graph (defined below) is 2-edge connected. Intuitively, every edge of the dual graph corresponds to a pair of adjacent cells that are both incident to the same vertex.
Aichholzer et al. recently conjectured that given an even number of line-segment obstacles, one can construct a convex partition by successively extending the segments along their supporting lines such that the dual graph is the union of two edge-disjoint spanning trees. Here we present a counterexamples to this conjecture, with n disjoint line segments for any n ≥ 15, such that the dual graph of any convex partition constructed by this method has a bridge edge, and thus the dual graph cannot be partitioned into two spanning trees.
Unable to display preview. Download preview PDF.
- 2.Andrzejak, A., Aronov, B., Har-Peled, S., Seidel, R., Welzl, E.: Results on k-sets and j-facets via continuous motion. In: Proc. 14th SCG, pp. 192–199. ACM, New York (1998)Google Scholar
- 4.Benbernou, N., Demaine, E.D., Demaine, M.L., Hoffmann, M., Ishaque, M., Souvaine, D.L., Tóth, C.D.: Disjoint segments have convex partitions with 2-edge connected dual graphs. In: Proc. CCCG, pp. 13–16 (2007)Google Scholar
- 5.Benbernou, N., Demaine, E.D., Demaine, M.L., Hoffmann, M., Ishaque, M., Souvaine, D.L., Tóth, C.D.: Erratum for Disjoint segments have convex partitions with 2-edge connected dual graphs. In: Proc. CCCG, p. 223 (2008)Google Scholar
- 7.Carlsson, J.G., Armbruster, B., Ye, Y.: Finding equitable convex partitions of points in a polygon efficiently. ACM Transactions on Algorithms (to appear, 2009)Google Scholar