Sciweavers

FOCS
2010
IEEE
13 years 8 months ago
A Non-linear Lower Bound for Planar Epsilon-Nets
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
Noga Alon
JGTOOLS
2008
53views more  JGTOOLS 2008»
13 years 10 months ago
Query Sphere Indexing for Neighborhood Requests
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
Nicolas Brodu