Skip to main content
SpringerLink
Log in

Discrete Geometry on Colored Point Sets in the Plane—A Survey

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Discrete geometry on colored point sets in the plane has a long history, but this research area has been extensively developed in the last 2 decades. In 2003, a short survey entitled “Discrete geometry on red and blue points in the plane: A survey” was published. Since then, many new and important results have been published, and thus the need of a new and up-to-date survey is evident.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38
Fig. 39
Fig. 40
Fig. 41
Fig. 42
Fig. 43
Fig. 44
Fig. 45
Fig. 46
Fig. 47
Fig. 48
Fig. 49
Fig. 50
Fig. 51
Fig. 52
Fig. 53
Fig. 54
Fig. 55
Fig. 56
Fig. 57
Fig. 58

Similar content being viewed by others

References

  1. Abellanas, M., García, J., Hernández, G., Noy, M., Ramos, P.: Bipartite embeddings of trees in the plane. Discrete Appl. Math. 93, 141–148 (1999)

    Article  MathSciNet  Google Scholar 

  2. Abellanas, M., García, A., Hurtado, F., Tejel, J.: Caminos alternantes. Actas X Encuentros de Geometría Computacional (in spanish) 7–12 (2003)

  3. Ábrego, M., Fernández-Merchant, S., Kano, M., Orden, D., Pérez-Lantero, P., Seara, C., Tejel, J.: \(K_{1,3}\)-covering red and blue points in the plane. Discrete Math. Theor. Comput. Sci. 21(6), 29 (2019)

    MathSciNet  Google Scholar 

  4. Aichholzer, O., Atienza, N., Días-Báñez, J.M., Fabila-Monroy, R., Flores-Peñaloza, D., Pérez-Lantero, P., Vogtenhuber, B., Urrutia, J.: Computing balanced islands in two colored point sets in the plane. Inf. Process. Lett. 135, 28–32 (2018)

    Article  MathSciNet  Google Scholar 

  5. Aichholzer, O., Barba, L., Hackl, T., Pilz, A., Vogtenhuber, B.: Linear transformation distance for bichromatic matchings. Comput. Geom. 68, 77–88 (2018)

    Article  MathSciNet  Google Scholar 

  6. Aichholzer, O., Cabello, S., Fabila-Monroy, R., Flores-Peñaloza, D., Hackl, T., Huemer, C., Hurtado, F., Wood, D.: Edge-removal and non-crossing configurations in geometric graphs. Discrete Math. Theor. Comput. Sci. 12, 75–86 (2010)

    MathSciNet  Google Scholar 

  7. Aichholzer, O., Fabila-Monroy, R., Flores-Peñaloza, D., Hackl, T., Huemer, C., Urrutia, J.: Empty monochromatic triangles. Comput. Geom. 42, 934–938 (2009)

    Article  MathSciNet  Google Scholar 

  8. Aichholzer, O., Fabila-Monroy, R., Hackl, T., Huemer, C., Urrutia, J.: Empty monochromatic simplices. Discrete Comput. Geom. 42, 362–393 (2014)

    Article  MathSciNet  Google Scholar 

  9. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Vogtenhuber, B.: Large bichromatic point sets admit empty monochromatic 4-gons. SIAM J. Discrete Math. 23, 2147–2155 (2009-10)

  10. Akiyama, J., Alon, N.: Disjoint simplices and geometric hypergraphs, Combinatorial Combinatorial Mathematics: Proceedings of the third international conference (New York, 1985), Ann. New York Acad. Sci. vol. 555, pp. 1–3. New York Acad. Sci., New York (1989)

  11. Akiyama, J., Kaneko, A., Kano, M., Nakamura, G., Rivera-Campo, E., Tokunaga, S., Urrutia, J.: Radical perfect partitions of convex sets in the plane Discrete and computational geometry (Tokyo, 1998), Lecture Notes in Comput. Sci., vol. 1763, pp. 1–13. Springer, Berlin (2000)

  12. Akiyama, J., Urrutia, J.: Simple bichromatic path problem. Discrete Math. 84, 101–103 (1990)

    Article  MathSciNet  Google Scholar 

  13. Akopyan, A., Karasev, R.: Cutting the same fraction of several measures. Discrete Comput. Geom. 49, 402–410 (2013)

    Article  MathSciNet  Google Scholar 

  14. Alon, N.: Splitting necklaces. Adv. Math. 63, 247–253 (1987)

    Article  MathSciNet  Google Scholar 

  15. Alon, N., West, D.B.: The Borsuk–Ulam theorem and bisection of necklaces. Proc. Am. Math. Soc. 98, 623–628 (1986)

    Article  MathSciNet  Google Scholar 

  16. Aloupis, G., Barba, L., Langerman, S., Souvaine, D.L.: Bichromatic compatible matchings. Comput. Geom. 48, 622–633 (2015)

    Article  MathSciNet  Google Scholar 

  17. Baloglou, G.: Personal communication (1999)

  18. Bárány, I., Blagojević, P., Blagojević, A.D.: Functions, measures, and equipartitioning convex \(k\)-fans. Discrete Comput. Geom. 49, 382–401 (2013)

    Article  MathSciNet  Google Scholar 

  19. Bárány, I., Matoušek, J.: Simultaneous partitions of measures by \(k\)-fans. Discrete Comput. Geom. 25, 317–334 (2001)

    Article  MathSciNet  Google Scholar 

  20. Bárány, I., Matoušek, J.: Equipartition of two measures by a 4-fan. Discrete Comput. Geom. 27, 293–301 (2002)

    Article  MathSciNet  Google Scholar 

  21. Barba, L., Pilz, A., Schnider, P.: Sharing a pizza: bisecting masses with two cuts (2019). arXiv:1904.02502v1

  22. Bereg, S.: Equipartitions of measures by 2-fans. Discrete Comput. Geom. 34, 87–96 (2005)

    Article  MathSciNet  Google Scholar 

  23. Bereg, S.: Orthogonal equipartitions. Discrete Comput. Geom. 42, 305–314 (2009)

    Article  MathSciNet  Google Scholar 

  24. Bereg, S., Bose, P., Kirkpatrick, D.: Equitable subdivisions within polygonal regions. Comput. Geom. 34, 20–27 (2006)

    Article  MathSciNet  Google Scholar 

  25. Bereg, S., Díaz-Báñez, J.M., Fabila-Monroy, R., Pérez-Lantero, P., Ramírez-Vigueras, A., Sakai, T., Urrutia, J., Ventura, I.: On balanced 4-holes in bichromatic point sets. Comput. Geom. 48, 169–179 (2015)

    Article  MathSciNet  Google Scholar 

  26. Bereg, S., Díaz-Báñez, J.M., Lara, D., Pérez-Lantero, P., Urrutia, J.: On the coarseness of bicolored point sets. Comput. Geom. 45, 65–77 (2013)

    Article  MathSciNet  Google Scholar 

  27. Bereg, S., Hurtado, F., Kano, M., Kormand, M., Lara, D., Seara, C., Silveira, R., Urrutia, J., Verbeek, K.: Balanced partitions of 3-colored geometric sets in the plane. Discrete Appl. Math. 181, 21–32 (2015)

    Article  MathSciNet  Google Scholar 

  28. Bereg, S., Kano, M.: Balanced line for a 3-colored point set in the plane. Electron. J. Comb. 19(1), 4 (2012). (Paper 33)

    Article  MathSciNet  Google Scholar 

  29. Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham sandwich cuts to equitable subdivisioons. Discrete Comput. Geom. 24, 605–622 (2000)

    Article  MathSciNet  Google Scholar 

  30. Biniaz, A., Bose, P., Maheshwari, A., Smid, M.: Plane bichromatic trees of low degree. Discrete Comput. Geom. 59, 864–885 (2018)

    Article  MathSciNet  Google Scholar 

  31. Blagojević, P.V.M., Blagojević, A.S.D.: Using equivariant obstruction theory in combinatorial geometry. Topol. Appl. 154, 2635–2655 (2007)

    Article  MathSciNet  Google Scholar 

  32. Blagojević, P.V.M., Rote, G., Steinmeyer, J.K., Ziegler, G.M.: Convex equipartitions of colored point sets. Discrete Comput. Geom. 61, 355–363 (2019)

    Article  MathSciNet  Google Scholar 

  33. Borsuk, K.: Drei Sätze über die \(n\)-dimensionale enuklidische Sphäre. Fundamenta Mathematicase 20, 177–190 (1933)

    Article  Google Scholar 

  34. Bose, P., Demaine, E., Hurtado, F., Iacon, J., Langerman, S., Morin, P.: Geodesic ham-sandwich cuts. Discrete Comput. Geom. 37, 325–339 (2007)

    Article  MathSciNet  Google Scholar 

  35. Buck, R., Buck, E.: Equipartitioning of convex sets. Math. Mag. 22, 195–198 (1949)

    Article  MathSciNet  Google Scholar 

  36. Buot, J., Kano, M.: Weight equitable subdivision of red and blue points in the plane. Int. J. Comput. Geom. Appl. 28, 39–56 (2018)

    Article  MathSciNet  Google Scholar 

  37. Cibulka, J., Kynčl, J., Mészáros, V., Stolař, R., Valtr, P.: Hamiltonian Alternating Paths on Bicolored Double-chains, Thirty Essays on Geometric Graph Theory, pp. 101–119. Springer, Berlin (2013)

    Book  Google Scholar 

  38. Claverol, M., García, A., Garijo, D., Seara, C., Tejel, J.: On Hamiltonian alternating cycles and paths. Comput. Geom. 68, 146–166 (2018)

    Article  MathSciNet  Google Scholar 

  39. Claverol, M., Garijo, D., Hurtado, F., Lara, D., Seara, C.: The alternating path problem revisited. In: Proceedings of XV EGC, Sevilla, June 26–28, pp. 115–118 (2013)

  40. Czyzowciz, J., Hurtado, F., Urrutia, J., Zaguia, N.: On polygons enclosing point sets. Geombinatorics 11, 21–28 (2001)

    MathSciNet  Google Scholar 

  41. Devillers, O., Hurtado, F., Károlyi, G., Seara, C.: Chromatic variants of the Erdős–Szekeres theorem on points in convex position. Comput. Geom. 26, 193–208 (2003)

    Article  MathSciNet  Google Scholar 

  42. Díaz-Báñez, J.M., Fabila-Monroy, R., Ventura, I.: New results on the coarseness of bicolored point sets. Inf. Process. Lett. 123, 1–7 (2017)

    Article  MathSciNet  Google Scholar 

  43. Di Giacomo, E., Liotta, G., Trotta, F.: How to Embed a Path onto Two Sets of Points, Graph drawing. Lecture Notes in Computer Science, vol. 3843, pp. 111–116. Springer, Berlin (2006)

    Google Scholar 

  44. Dumitrescu, A., Kaye, R.: Matching colored points in the plane: some new results. Comput. Geom. 19, 69–85 (2001)

    Article  MathSciNet  Google Scholar 

  45. Dumitrescu, A., Steiger, W.: On a matching problem in the plane. Discrete Math. 211, 183–195 (2000)

    Article  MathSciNet  Google Scholar 

  46. Fulek, R., Keszegh, B., Moríc, F., Uljarević, I.: On polygons excluding point sets. Graphs Combin. 29, 1741–1753 (2013)

    Article  MathSciNet  Google Scholar 

  47. Garijo, D., Garrido, M.A., Grima, C.I., Márquez, A., Moreno-González, A., Portillo, J.R., Reyes, P.,Robles, R., Valenzuela, J.: Monochromatic geometric \(k\)-factors in red-blue sets with white and Steiner points. In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes Discrete Math., vol. 34, pp. 151–155 (2009)

  48. Garijo, D., Garrido, M.A., Grima, C.I., Márquez, A., Moreno-González, A., Portillo, J.R., Reyes, P., Robles, R., Valenzuela, J.: Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points. Inf. Process. Lett. 114, 19–24 (2014)

    Article  MathSciNet  Google Scholar 

  49. Giacomo, E.D., Grilli, L., Krug, M., Liotta, G., Rutter, I.: Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16, 34–52 (2012)

    Article  MathSciNet  Google Scholar 

  50. Goldberg, C.H., West, D.B.: Bisection of circle colorings. SIAM J. Algebraic Discrete Methods 6, 93–106 (1985)

    Article  MathSciNet  Google Scholar 

  51. Goodman, J.E., O’Rourke, J.: (Edited): Handbook of discrete and computational geometry, 2nd edn. Chapman & Hall/CRC, Boca Raton (2004)

    Google Scholar 

  52. Grima, C., Hernando, C., Huemer, C., Hurtado, F.: On some partitioning problems for two-colored point sets. In: Proceedings of XIII Encuentros de GDeometrýa Computacional, Zaragoza, Spain (2009)

  53. Holmsen, A., Kynčl, J., Valculescu, C.: Near equipartitions of colored point sets. Comput. Geom. 65, 35–42 (2017)

    Article  MathSciNet  Google Scholar 

  54. Hoffmann, M., Speckmann, B., Tóth, C.D.: Pointed binary encompassing trees: simple and optimal. Comput. Geom. 43, 35–41 (2010)

    Article  MathSciNet  Google Scholar 

  55. Hoffmann, M., Tóth, C.: Vertex-colored encompassing graphs. Graphs Comb. 30, 933–947 (2014)

    Article  MathSciNet  Google Scholar 

  56. Hubard, A., Karasev, R.: Bisecting Measures with Hyperplane Arrangements. Cambridge University Press, Cambridge (2019). https://doi.org/10.1017/S0305004119000380

    Book  Google Scholar 

  57. Huemer, C., Seara, C.: 36 two-colored points with no empty monochromatic convex fourgons. Geombinatorics 19, 5–6 (2009)

    MathSciNet  Google Scholar 

  58. Hurtado, F., Kano, M., Rappaport, D., Tóth, C.D.: Encompassing colored planar straight line graphs. Comput. Geom. 39, 14–23 (2008)

    Article  MathSciNet  Google Scholar 

  59. Hurtado, F., Merino, C., Oliveros, D., Sakai, T., Urrutia, J., Ventura, I.: On polygons enclosing point sets II. Graphs Comb. 25, 327–339 (2009)

    Article  MathSciNet  Google Scholar 

  60. Ito, H., Uehara, H., Yokoyama, M.: 2-Dimensional Ham-sandwich Theorem for Partitioning into Three Convex Pieces, Discrete and Computational Geometry (Tokyo, 1998), Lecture Notes in Computer Science, vol. 1763, pp. 129–157. Springer, Berlin (2000)

    Google Scholar 

  61. Kankeo, A.: On the Maximum Degree of Bipartite Embeddings of Trees in the Plane, Discrete and Computational Geometry (Tokyo, 1998), Lecture Notes in Computer Science, vol. 1763, pp. 166–171. Springer, Berlin (2000)

    Google Scholar 

  62. Kaneko, A., Kano, M.: Balanced partitions of two sets of points in the plane. Comput. Geom. 13, 253–261 (1999)

    Article  MathSciNet  Google Scholar 

  63. Kaneko, A., Kano, M.: Straight line embeddings of rooted star forests in the plane. Discrete Appl. Math. 101, 167–175 (2000)

    Article  MathSciNet  Google Scholar 

  64. Kaneko, A., Kano, M.: On Paths in a Complete Bipartite Geometric Graph, Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2098, pp. 187–191. Springer, Berlin (2001)

    Google Scholar 

  65. Kaneko, A., Kano, M.: Generalized Balanced Partitions of Two Sets of Points in the Plane, Discrete and Computational Geometry (Tokyo, 2000), Lecture Notes in Computer Science, vol. 2098, pp. 176–186. Springer, Berlin (2001)

    Google Scholar 

  66. Kaneko, A., Kano, M.: Perfect \(n\)-partitions of convex sets in the plane. Discrete Comput. Geom. 28, 211–222 (2002)

    Article  MathSciNet  Google Scholar 

  67. Kaneko, A., Kano, M.: Discrete Geometry on Red and Blue Points in the Plane—A Survey, Discrete and Computational Geometry. Algorithms Combination, vol. 25, pp. 551–570. Springer, Berlin (2003)

    Google Scholar 

  68. Kaneko, A., Kano, M.: A Balanced Interval of Two Sets of Points on a Line, Combinatorial Geometry and Graph Theory, Lecture Notes in Computer Science, vol. 3330, pp. 108–112. Springer, Berlin (2005)

    Google Scholar 

  69. Kaneko, A., Kano, M.: Semi-balanced partition of two sets of points and embedding of rooted forests Internat. J. Comput. Geom. Appl. 15, 229–238 (2005)

    Article  MathSciNet  Google Scholar 

  70. Kaneko, A., Kano, M., Suzuki, K.: Path Coverings of Two Sets of Points in the Plane, Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol. 342, pp. 99–111. American Mathematical Society, Providence (2004)

    Google Scholar 

  71. Kaneko, A., Kano, M., Yoshimoto, K.: Alternating Hamiltonian cycles with minimum number of crossings in the plane. Int. J. Comput. Geom. Appl. 10, 73–78 (2000)

    Article  Google Scholar 

  72. Kano, M., Kynčl, J.: The hamburger theorem. Comput. Geom. 68, 167–173 (2018)

    Article  MathSciNet  Google Scholar 

  73. Kano, M., Merino, C., Urrutia, J.: On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93, 301–306 (2005)

    Article  MathSciNet  Google Scholar 

  74. Kano, M., Suzuki, K., Uno, M.: Properly Colored Geometric Matchings and 3-trees Without Crossings on Multicolored Points in the Plane, Discrete and Computational Geometry and Graphs, Lecture Notes in Computer Science, vol. 8845, pp. 96–111. Springer, Cham (2014)

    Google Scholar 

  75. Kano, M., Suzuki, K.: Discrete Geometry on Red and Blue Points in the Plane Lattice Thirty Essays on Geometric Graph Theory, pp. 355–369. Springer, Berlin (2013)

    Book  Google Scholar 

  76. Kano, M., Suzuki, K.: Personal communication (2014)

  77. Kano, M., Uno, M.: General Balanced Subdivision of Two Sets of Points in the Plane, Discrete Geometry, Combinatorics and Graph Theory, Lecture Notes in Computer Science, vol. 4381, pp. 79–87. Springer, Berlin (2007)

    Google Scholar 

  78. Kano, M., Uno, M.: Balanced subdivision with boundary condition of two sets of points in the plane. Int. J. Comput. Geom. Appl. 20, 527–541 (2010)

    Article  MathSciNet  Google Scholar 

  79. Karasev, R.N.: Equipartition of several measures (2010). arXiv:1011.4762v7

  80. Karasev, R.N., Hubard, A., Aronov, B.: Convex equipartition: the spicy chicken theorem. Geom. Dedicata 170, 263–279 (2014)

    Article  MathSciNet  Google Scholar 

  81. Karasev, R.N., Roldán-Pensado, E., Soberón, P.: Measure partitions using hyperplanes with fixed directions. Isr. J. Math. 212, 705–728 (2016)

    Article  MathSciNet  Google Scholar 

  82. Kleitman, D.J., Pinchasi, R.: A note on the number of bichromatic lines. http://www2.math.technion.ac.ilroom/ps_files/KP_bichnum.pdf/. Accessed 2003

  83. Koshelev, V.A.: On Erdős–Szekeres problem and related problems (2009). arXiv:0910.2700v1

  84. Kynčl, J.: Personal communication (2014)

  85. Kynčl, J., Pach, J., Tóth, G.: Long alternating paths in bicolored point ets. Discrete Math. 308, 4315–4321 (2008)

    Article  MathSciNet  Google Scholar 

  86. Leanos, J., Merino, C., Slazar, G., Urrutia, J.: Spanning Trees of Mutlicolored Point Sets with Few Intersections, Combinatorial Geometry and Graph Theory, Lecture Notes in Computer Science, vol. 3330, pp. 113–122. Springer, Berlin (2005)

    Google Scholar 

  87. Lo, C.-Y., Matoušek, J., Steiger, W.: Algorithms for ham-sandwich cuts. Discrete Comput. Geom. 11, 433–452 (1994)

    Article  MathSciNet  Google Scholar 

  88. Matoušek, J.: Using the Borsuk–Ulam Theorem. Springer, Berlin (2003)

    Google Scholar 

  89. Motzkin, T.S.: Nonmixed connecting lines, Abstract 67T 605. Not. Am. Math. Soc. 14, 837 (1967)

    Google Scholar 

  90. Megiddo, N.: Partitioning with two lines in the plane. J. Algorithms 6, 430–433 (1985)

    Article  MathSciNet  Google Scholar 

  91. Merino, C., Salazar, G., Urrutia, J.: On the length of longest alternating paths for multicolores point sets in convex position. Discrete Math. 306, 1791–1797 (2006)

    Article  MathSciNet  Google Scholar 

  92. Merino, C., Salazar, G., Urrutia, J.: On the Intersection number of matchings and minimum weight perfect matchings of multicolored point sets. Graphs Comb. 21, 333–341 (2005)

    Article  MathSciNet  Google Scholar 

  93. Orden, D., Ramos, P., Salazar, G.: The number of generalized balanced lines. Discrete Comput. Geom. 44, 805–811 (2010)

    Article  MathSciNet  Google Scholar 

  94. Pach, J.: Geometric Graph Theory, Surveys in Combinatorics, 1999 (Canterbury), London Mathematical Society Lecture Note Series, vol. 267, pp. 167–200. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  95. Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. Wiley, New York (1995)

    Google Scholar 

  96. Pach, J., Pinchasi, R.: Bichromatic lines with few points. J. Comb. Theory Ser. A 90, 326–335 (2000)

    Article  MathSciNet  Google Scholar 

  97. Pach, J., Pinchasi, R.: On the number of balanced lines. Discrete Comput. Geom. 25, 611–628 (2001)

    Article  MathSciNet  Google Scholar 

  98. Pach, J., Tóth, G.: Monochromatic Empty Triangles in Two-colored Point Sets, Geometry, Games, Graphs and Education: the Joe Malkevitch Festschrift, pp. 195–198. Comap Inc, Bedford (2008)

    Google Scholar 

  99. Purdy, G.B., Smith, J.W.: Bichromatic and equichromatic lines in \({\mathbb{C}}^2\) and \({\mathbb{R}}^2\). Discrete Comput. Geom. 43, 563–576 (2010)

    Article  MathSciNet  Google Scholar 

  100. Sakai, T.: Balanced convex partitions of measures in \({\mathbb{R}}^{2}\). Graphs Comb. 18, 169–192 (2002)

    Article  MathSciNet  Google Scholar 

  101. Sharir, M., Welzl, E.: Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem, Discrete and Computational Geometry. Algorithms Combination, vol. 25, pp. 789–797. Springer, Berlin (2003)

    Google Scholar 

  102. Soberón, P.: Balanced convex partitions of measures in \({\mathbb{R}}^d\). Mathematika 58, 71–76 (2012)

    Article  MathSciNet  Google Scholar 

  103. Steinhaus, H.: Sur la division des ensembles de l’espace par les plans et des ensembles plans par les cercles. Fundam. Math. 33, 245–263 (1945)

    Article  MathSciNet  Google Scholar 

  104. Stone, A.H., Tukey, J.W.: Generalized “sandwich” theorems. Duke Math. J. 9, 356–359 (1942)

    Article  MathSciNet  Google Scholar 

  105. Tokunaga, S.: Intersection number of two connected geometric graphs. Inf. Process. Lett. 59, 331–333 (1996)

    Article  MathSciNet  Google Scholar 

  106. Uno, M., Kawano, T., Kano, M.: Bisections of two sets of points in the plane lattice. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E92–A, 502–507 (2009)

    Article  Google Scholar 

  107. Živaljević, R.T.: Combinatorics and topology of partitions of spherical measures by 2 and 3 fans (2002). arXiv:math/0203028v2

  108. Živaljević, R.T.: Topological methods. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Discrete Mathematics and its Applications, 2nd edn. Chapman & Hall/CRC, Boca Raton (2004)

    Google Scholar 

Download references

Acknowledgements

The research of the first author was supported by JSPS KAKENHI Grant number 19K03597. The research of the second author was supported by PAPIIT Grant IN102117 from the Universidad Nacional Autónoma de México. The authors are grateful to the anonymous referee for his very careful reading and detailed comments and suggestions that much improved the paper. The authors also would like to thank Jan Kynčl and Jude Buot for their valuable comments and suggestions.

Author information

Authors and Affiliations

  1. Ibaraki University, Hitachi, Ibaraki, Japan

    Mikio Kano

  2. Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico, DF, Mexico

    Jorge Urrutia

Authors
  1. Mikio Kano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikio Kano.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kano, M., Urrutia, J. Discrete Geometry on Colored Point Sets in the Plane—A Survey. Graphs and Combinatorics 37, 1–53 (2021). https://doi.org/10.1007/s00373-020-02210-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02210-8

Keywords

Mathematics Subject Classification

Search

Navigation