Sciweavers

SODA
2010
ACM
162views Algorithms» more  SODA 2010»
14 years 2 months ago
The forest hiding problem
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
Adrian Dumitrescu, Minghui Jiang