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.
Type de document :
Communication dans un congrès
13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada. 〈http://www.cccg.ca/proceedings/2001/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01179059
Contributeur : Olivier Devillers <>
Soumis le : mardi 21 juillet 2015 - 15:28:39
Dernière modification le : jeudi 11 janvier 2018 - 16:21:50

Identifiants

  • 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. 〈http://www.cccg.ca/proceedings/2001/〉. 〈hal-01179059〉

Partager

Métriques

Consultations de la notice

77