42 search results - page 1 / 9 » Separating points by axis-parallel lines |
GC
2006
Springer
13 years 5 months ago
2006
Springer
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...
CCCG
2004
13 years 6 months ago
2004
CVPR
2011
IEEE
12 years 9 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
ISAAC
2009
Springer
14 years 7 hour ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...