Separating Several Point Sets in the Plane

Olivier Devillers (1) , Ferran Hurtado (2) , Mercè Mora (2) , Carlos Seara (2)

1 GEOMETRICA - Geometric computing
2 Departament de Matemàtica Aplicada II

In this paper we study som problems on the separability of k disjoint point sets in the plane. One one hand, we give algorithms for finding minimum cardinality separators by means of parallel lines or rays with common apex. On the other hand we show how to decide whether it is possible to separate by k-1 parallel lines, k rays with the same origin, an arrangement of 2-3 lines or, in the projective sense, by k lines through a point.

Domaines: Géométrie algorithmique [cs.CG]

Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara. Separating Several Point Sets in the Plane. 13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada. ⟨hal-01179059⟩