On plane spanning trees and cycles of multicolored point sets with few intersections

Authors:
M. Kano;C. Merino;J. Urrutia
Affiliations:
Department of Computer and Information Science, Ibaraki University, Hitachi 316-8511, Japan;Instituto de Matemáticas, U.N.A.M. Área de la investigación científica, Circuito Exterior, Ciudad Universitaria Coyoacán 04510, México D.F., Mexico;Instituto de Matemáticas, U.N.A.M. Área de la investigación científica, Circuito Exterior, Ciudad Universitaria Coyoacán 04510, México D.F., Mexico
Venue:
Information Processing Letters
Year:
2005

Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines

Fundamenta Informaticae
Spanning trees of multicoloured point sets with few intersections

IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory

Hi-index	0.89

Let P"1,...,P"k be a collection of disjoint point sets in R^2 in general position. We prove that for each 1=