Distribution-sensitive point location in convex subdivisions

Authors:
Sébastien Collette;Vida Dujmović;John Iacono;Stefan Langerman;Pat Morin
Affiliations:
Chargé de Recherches du FNRS, Université Libre de Bruxelles;McGill University;Polytechnic University;Chercheur Qualifié du FNRS, Université Libre de Bruxelles;Carleton University
Venue:
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2008

Citing 15
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Planar point location using persistent search trees

Communications of the ACM
Optimal point location in a monotone subdivision

SIAM Journal on Computing
A fast planar partition algorithm, I

Journal of Symbolic Computation
Two notes on notation

American Mathematical Monthly
Methods for achieving fast query times in point location data structures

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the exact worst case query complexity of planar point location

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Optimal planar point location

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nearly optimal expected-case planar point location

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Expected asymptotically optimal planar point location

Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Planar Point Location in Sublogarithmic Time

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Optimal Expected-Case Planar Point Location

SIAM Journal on Computing

Biased range trees

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A static optimality transformation with applications to planar point location

Proceedings of the twenty-seventh annual symposium on Computational geometry
Entropy, triangulation, and point location in planar subdivisions

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 that differs from the optimal one by only lower order terms in the linear comparison tree model.