Convex partitions with 2-edge connected dual graphs
- 78 Downloads
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 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.
KeywordsConvex partitions Dual graphs Geometric matchings
Unable to display preview. Download preview PDF.
- Andrzejak A, Aronov B, Har-Peled S, Seidel R, Welzl E (1998) Results on k-sets and j-facets via continuous motion. In: Proc 14th Sympos Comput Geom. ACM, New York, pp 192–199 Google Scholar
- Benbernou N, Demaine ED, Demaine ML, Hoffmann M, Ishaque M, Souvaine DL, Tóth CD (2007) Disjoint segments have convex partitions with 2-edge connected dual graphs. In: Proc Canadian Conf Comput Geom, pp 13–16 Google Scholar
- Benbernou N, Demaine ED, Demaine ML, Hoffmann M, Ishaque M, Souvaine DL, Tóth CD (2008) Erratum for “Disjoint segments have convex partitions with 2-edge connected dual graphs”. In: Proc Canadian Conf Comput Geom, p 223 Google Scholar
- Carlsson JG, Armbruster B, Ye Y (2009) Finding equitable convex partitions of points in a polygon efficiently. ACM Trans Algorithms (to appear) Google Scholar
- Ishaque M, Speckmann B, Tóth CD (2009) Shooting permanent rays among disjoint polygons in the plane. In: Proc 25th Sympos Comput Geom. ACM, New York, pp 51–60 Google Scholar
- Knauer C, Spillner A (2006) Approximation algorithms for the minimum convex partition problem. In: Proc SWAT. LNCS, vol 4059. Springer, Berlin, pp 232–241 Google Scholar
- Lingas A (1982) The power of non-rectilinear holes. In: Proc 9th ICALP. LNCS, vol 140. Springer, Berlin, pp 369–383 Google Scholar
- Tan G, Bertier M, Kermarrec A-M (2009) Convex partition of sensor networks and its use in virtual coordinate geographic routing. In: Proc INFOCOM. IEEE Comput Soc, Los Alamitos, pp 1746–1754 Google Scholar