49 search results - page 1 / 10 » Lower bounds for expected-case planar point location |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
SWAT
2000
Springer
13 years 8 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...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
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...