Name
Abstract | ||
|---|---|---|
Let R and B be two disjoint sets of red points and blue points in the plane, respectively, such that no three points of R boolean OR B are collinear, and let a, b and g be positive integers. We show that if ag <= vertical bar R vertical bar < (a + 1)g and bg <= vertical bar B vertical bar < (b + 1)g, then we can subdivide the plane into g convex polygons so that every open convex polygon contains exactly a red points and b blue points and that the remaining points lie on the boundary of the subdivision. This is a generalization of equitable subdivision of ag red points and bg blue points in the plane. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0218195910003426 | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
Balanced subdivision, red points and blue points, convex polygon | Journal | 20 |
Issue | ISSN | Citations |
5 | 0218-1959 | 2 |
PageRank | References | Authors |
0.45 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikio Kano | 1 | 548 | 99.79 |
| Miyuki Uno | 2 | 10 | 2.19 |