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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01179059
Contributor : Olivier Devillers <>
Submitted on : Tuesday, July 21, 2015 - 3:28:39 PM
Last modification on : Saturday, January 27, 2018 - 1:30:51 AM

Identifiers

  • HAL Id : hal-01179059, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

142