Separating Several Point Sets in the Plane - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Separating Several Point Sets in the Plane

Abstract

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.
No file

Dates and versions

hal-01179059 , version 1 (21-07-2015)

Identifiers

  • HAL Id : hal-01179059 , version 1

Cite

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⟩
73 View
0 Download

Share

Gmail Facebook X LinkedIn More