On the exact worst case query complexity of planar point location

Authors:
Udo Adamy;Raimund Seidel
Affiliations:
Fachbereich Informatik, Univ. des Saarlandes, Postfach 151150, D-66041 Saarbrücken, Germany;Fachbereich Informatik, Univ. des Saarlandes, Postfach 151150, D-66041 Saarbrücken, Germany
Venue:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Year:
1998

Citing 7
Cited 4

Planar point location using persistent search trees

Communications of the ACM
Searching and sorting similar lists

Journal of Algorithms
Optimal point location in a monotone subdivision

SIAM Journal on Computing
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
New results on dynamic planar point location

SIAM Journal on Computing
Methods for achieving fast query times in point location data structures

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A new point-location algorithm and its practical efficiency: comparison with existing algorithms

ACM Transactions on Graphics (TOG)

Planar Point Location for Large Data Sets: To Seek or Not to Seek

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Planar point location for large data sets: to seek or not to seek

Journal of Experimental Algorithmics (JEA)
Distribution-sensitive point location in convex subdivisions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Entropy, triangulation, and point location in planar subdivisions

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract