451 search results - page 76 / 91 » Some Lower Bounds on Geometric Separability Problems |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
107
click to vote
COMPGEOM
2007
ACM
14 years 11 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
SWAT
2000
Springer
15 years 1 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...