Discrete Geometry on 3 Colored Point sets in the Plane (Designs, Codes, Graphs and Related Areas)
Mikio Kanō · Institutional Repositories DataBase (IRDB) · 2014
3 colored point sets in the planeLet $R,$ $B$ and $G$ denote disjoint sets of red points, blue points and green points in the plane, respectively.If no three points of $R\cup B\cup G$ are collinear, we say that $R,$ $B$ and $G$ are in general position in the plane.We always assume that given sets of colored points are in general position.We begin with the following well-known theorem on two colored point sets in the plane.Notice that a geometric graph is a graph drawn in the plane whose edges are straight line segments, and every edge of an alternating matching joins two points with distinct colors.