1397 search results - page 1 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
CCCG
1993
13 years 6 months ago
1993
CCCG
2006
13 years 6 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
APPROX
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
SIAMJO
2010
13 years 2 days ago
2010
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
DAM
2011
13 years 9 days ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...