Discrete & Computational Geometry

, Volume 49, Issue 1, pp 89–131 | Cite as

Disjoint Compatible Geometric Matchings

  • Mashhood Ishaque
  • Diane L. Souvaine
  • Csaba D. Tóth
Article

Abstract

We prove that for every set of n pairwise disjoint line segments in the plane in general position, where n is even, there is another set of n segments such that the 2n segments form pairwise disjoint simple polygons in the plane. This settles in the affirmative the Disjoint Compatible Matching Conjecture by Aichholzer et al. (Comput. Geom. 42:617–626, 2009). The key tool in our proof is a novel subdivision of the free space around n disjoint line segments into at most n+1 convex cells such that the dual graph of the subdivision contains two edge-disjoint spanning trees.

References

  1. 1.
    Aichholzer, O., Bereg, S., Dumitrescu, A., García, A., Huemer, C., Hurtado, F., Kano, M., Márquez, A., Rappaport, D., Smorodinsky, S., Souvaine, D., Urrutia, J., Wood, D.: Compatible geometric matchings. Comput. Geom. 42, 617–626 (2009) MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Al-Jubeh, M., Ishaque, M., Hoffmann, M., Souvaine, D.L., Tóth, C.D.: Convex partitions with 2-edge connected dual graphs. J. Comb. Optim. 22(3), 409–425 (2010) CrossRefGoogle Scholar
  3. 3.
    Al-Jubeh, M., Barequet, G., Ishaque, M., Souvaine, D.L., Tóth, C.D., Winslow, A.: Constrained tri-connected planar straight line graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Algorithms and Combinatorics, vol. 29. Springer, Berlin (2013, to appear) Google Scholar
  4. 4.
    Benbernou, N.M., Demaine, E.D., Demaine, M.L., Hoffmann, M., Ishaque, M., Souvaine, D.L., Tóth, C.D.: Disjoint segments have a convex partition with a 2-edge connected dual graph. In: Proc. 19th Canadian Conf. Comp. Geom, Ottawa, ON, pp. 13–16 (2007). Erratum in Proc. 20th Canadian Conf. Comp. Geom., Montreal, QC, 2008, p. 223 Google Scholar
  5. 5.
    Bose, P., Houle, M.E., Toussaint, G.T.: Every set of disjoint line segments admits a binary tree. Discrete Comput. Geom. 26(3), 387–410 (2001) MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. In: Proc. 13th COCOON. LNCS, vol. 4598, pp. 97–107. Springer, Berlin (2007) Google Scholar
  7. 7.
    Cannon, S., Ishaque, M., Tóth, C.D.: Even orientations with forbidden pairs and demands. In: Proc. 6th Conf. on Fun with Algorithms. LNCS, vol. 7288, pp. 57–68. Springer, Berlin (2012) CrossRefGoogle Scholar
  8. 8.
    Cordovil, R., Moreira, M.L.: Bases–cobases graphs and polytopes of matroids. Combinatorica 13(2), 157–165 (1993) MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Farber, M., Richter, B., Shank, H.: Edge-disjoint spanning trees: a connectedness theorem. J. Graph Theory 8, 319–324 (1985) MathSciNetCrossRefGoogle Scholar
  10. 10.
    García, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K N. Comput. Geom. Theory Appl. 16, 211–221 (2000) MATHCrossRefGoogle Scholar
  11. 11.
    Hoffmann, M., Speckmann, B., Tóth, C.D.: Pointed binary encompassing trees: simple and optimal. Comput. Geom. Theory Appl. 43(1), 35–41 (2010) MATHCrossRefGoogle Scholar
  12. 12.
    Hoffmann, M., Sharir, M., Sheffer, A., Tóth, Cs.D., Welzl, E.: Counting plane graphs: flippability and its applications. In: Proc. WADS. LNCS, vol. 6844, pp. 524–535. Springer, Berlin (2011) Google Scholar
  13. 13.
    Hurtado, F., Tóth, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Algorithms and Combinatorics, vol. 29. Springer, Berlin (2013, to appear) Google Scholar
  14. 14.
    Lovász, L., Plummer, M.D.: Matching Theory. AMS Chelsea, New York (2009) MATHGoogle Scholar
  15. 15.
    Nash-Williams, C.St.-J.A.: Edge-disjoint spanning trees in finite graphs. J. Lond. Math. Soc. 36, 445–450 (1961) MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, London (1987) MATHGoogle Scholar
  17. 17.
    Razen, A.: A lower bound for the transformation of compatible perfect matchings. In: Abstracts of the 24th European Workshop on Comput. Geom, pp. 115–118 (2008) Google Scholar
  18. 18.
    Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36, 695–720 (2006) MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn’s technique. In: Proc. 28th Sympos. Comput. Geom., pp. 189–198. ACM, New York (2012) Google Scholar
  20. 20.
    Tóth, C.D.: Illuminating both sides of line segments. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry. LNCS, vol. 2098, pp. 370–380. Springer, Berlin (2001) CrossRefGoogle Scholar
  21. 21.
    Tóth, C.D.: Illumination in the presence of opaque line segments in the plane. Comput. Geom. Theory Appl. 21(3), 193–204 (2002) MATHCrossRefGoogle Scholar
  22. 22.
    Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221–230 (1961) MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Mashhood Ishaque
    • 1
  • Diane L. Souvaine
    • 1
  • Csaba D. Tóth
    • 1
    • 2
  1. 1.Department of Computer ScienceTufts UniversityMedfordUSA
  2. 2.Department of Mathematics and StatisticsUniversity of CalgaryCalgaryCanada

Personalised recommendations