8 search results - page 2 / 2 » Geometric Set Cover and Hitting Sets for Polytopes in $R^3$ |
ESA
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
MICS
2010
13 years 3 months ago
2010
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...