15 search results - page 1 / 3 » Planar Point Location in Sublogarithmic Time |
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
SODA
2001
ACM
13 years 5 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...
SODA
2008
ACM
13 years 5 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
FOCS
2000
IEEE
13 years 8 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...
COMGEO
2008
ACM
13 years 4 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...