Name
Abstract | ||
|---|---|---|
In this paper we study some problems on theseparability of k disjoint point sets in the plane.On one hand, we give algorithms for ndingminimum-cardinality separators by means ofparallel lines or rays with common apex. Onthe other hand we show how to decide whetherit is possible to separate by k 1 parallel lines,k rays with same origin, an arrangement of 23lines or, in the projective sense, by k linesthrough a point.Keywords : Separation, discrimination, classication.1 |
Year | Venue | Field |
|---|---|---|
2001 | CCCG | Discrete mathematics,Combinatorics,Disjoint sets,Cardinality,Parallel,Mathematics |
DocType | Citations | PageRank |
Conference | 4 | 0.65 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olivier Devillers | 1 | 184 | 23.75 |
| Ferran Hurtado | 2 | 744 | 86.37 |
| Mercè Mora | 3 | 195 | 18.40 |
| Carlos Seara | 4 | 309 | 30.30 |