Bottleneck Steiner Trees in the Plane
IEEE Transactions on Computers
Matching colored points in the plane: some new results
Computational Geometry: Theory and Applications
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Non-crossing matchings of points with geometric objects
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: white points whose position is fixed, and Steiner points which have no fixed position. Our approach provides algorithms for constructing those k-factors, and gives bounds on the number of auxiliary points needed to draw a monochromatic geometric planar k-factor of S.