1397 search results - page 24 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
DCG
1998
13 years 8 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
CCCG
2007
13 years 10 months ago
2007
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
APPROX
2006
Springer
14 years 6 days ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...