Self-adjusting binary search trees
Journal of the ACM (JACM)
Planar point location using persistent search trees
Communications of the ACM
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Entropy-preserving cuttings and space-efficient planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A simple entropy-based algorithm for planar point location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Alternatives to splay trees with O(log n) worst-case access times
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Local properties of geometric graphs
Computational Geometry: Theory and Applications
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
| Hi-index | 0.00 |
A new data structure is presented for planar point location that executes a point location query quickly if it is spatially near the previous query. Given a triangulation T of size n and a sequence of point location queries A=q1, qm, the structure presented executes qi in time O(log d(qi-1,qi)). The distance function, d, that is used is a two dimensional generalization of rank distance that counts the number of triangles in a region from qi-1 to qi. The data structure uses O(n log log n) space.