138 search results - page 1 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
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...
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...
WAE
2000
13 years 6 months ago
2000
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
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...