516 search results - page 104 / 104 » Generalizing the Discrete Timed Automaton |
COMPGEOM
2010
ACM
14 years 2 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 ...