1397 search results - page 37 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
IJCGA
2002
13 years 8 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
CCCG
2009
13 years 9 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
SIAMDM
2008
13 years 8 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...