Graphs and Combinatorics

, Volume 30, Issue 5, pp 1193–1205

# Quadrangulations on 3-Colored Point Sets with Steiner Points and Their Winding Numbers

Original Paper

## Abstract

Let P be a point set on the plane, and consider whether P is quadrangulatable, that is, whether there exists a 2-connected plane graph G with each edge a straight segment such that V(G) = P, that the outer cycle of G coincides with the convex hull Conv(P) of P, and that each finite face of G is quadrilateral. It is easy to see that it is possible if and only if an even number of points of P lie on Conv(P). Hence we give a k-coloring to P, and consider the same problem, avoiding edges joining two vertices of P with the same color. In this case, we always assume that the number of points of P lying on Conv(P) is even and that any two consecutive points on Conv(P) have distinct colors. However, for every k ≥ 2, there is a k-colored non-quadrangulatable point set P. So we introduce Steiner points, which can be put in any position of the interior of Conv(P) and each of which may be colored by any of the k colors. When k = 2, Alvarez et al. proved that if a point set P on the plane consists of $${\frac{n}{2}}$$ red and $${\frac{n}{2}}$$ blue points in general position, then adding Steiner points Q with $${|Q| \leq \lfloor \frac{n-2}{6} \rfloor + \lfloor \frac{n}{4} \rfloor +1}$$ , PQ is quadrangulatable, but there exists a non-quadrangulatable 3-colored point set for which no matter how many Steiner points are added. In this paper, we define the winding number for a 3-colored point set P, and prove that a 3-colored point set P in general position with a finite set Q of Steiner points added is quadrangulatable if and only if the winding number of P is zero. When PQ is quadrangulatable, we prove $${|Q| \leq \frac{7n+34m-48}{18}}$$ , where |P| = n and the number of points of P in Conv(P) is 2m.

### Keywords

Quadrangulation Plane Point set 3-Coloring Steiner point Winding number

## Preview

### References

1. 1.
Alvarez V., Sakai T., Urrutia J.: Bichromatic quadrangulations with Steiner points. Graph Combin. 23, 85–98 (2007)
2. 2.
Archdeacon D., Hutchinson J.P., Nakamoto A., Negam S., Ota K.: Chromatic numbers of quadrangulations on closed surfaces. J. Graph Theory 37, 100–114 (2001)
3. 3.
Bose P., Toussaint G.: Characterizing and efficiently computing quadrangulations of planar point sets. Comput. Aided Geom. Design 14, 763–785 (1997)
4. 4.
Bremner D., Hurtado F., Ramaswami S., Sacristán V.: Small convex quadrangulations of point sets. Algorithmica 38, 317–339 (2003)
5. 5.
Cortés, C., Márquez, A., Nakamoto, A., Valenzula, J.: Quadrangulations and 2-colorations. 21st European Workshop on Computational Geometry, Eindhoven, pp. 65–68 (2005)Google Scholar
6. 6.
Heredia, M.A., Urrutia, J.: On convex quadrangulations of point sets on the plane. Discrete Geometry, Combinatorics and Graph Theory, LNCS 4381, Proc. CJCDGCGT 2005, pp. 38–46 (2007)Google Scholar
7. 7.
Mohar B., Seymour P.D.: Coloring locally bipartite graphs on surfaces. J. Combin. Theory Ser. B 84, 301–310 (2002)
8. 8.
Ramaswami S., Ramos P., Toussaint G.: Converting triangulations to quadrangulations. Comput. Geom. 9, 257–276 (1998)
9. 9.
Toussaint, G.: Quadrangulations of planar sets. In: Proceedings of the 4th International Workshop on Algorithms and Data Structures. Springer, Berlin, pp. 218–227 (1995)Google Scholar
10. 10.
Youngs D.A.: 4-Chromatic projective graphs. J. Graph Theory 21, 219–227 (1996)