235 search results - page 27 / 47 » The Complexity of Separating Points in the Plane |
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
CCCG
2010
14 years 11 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
73
Voted
NIPS
2004
14 years 11 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
109
click to vote
SIAMIS
2010
14 years 4 months ago
2010
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...