100 search results - page 1 / 20 » A simple entropy-based algorithm for planar point location |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
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...
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
2008
ACM
13 years 6 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...
GD
2003
Springer
13 years 10 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...