Improved implementation of point location in general two-dimensional subdivisions

Michael Hemmer*, Michal Kleinbort, Dan Halperin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in Cgal, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point set S of size n, this also enables nearest-neighbor queries in guaranteed O(logn) time. Another major innovation is the support of general unbounded subdivisions as well as subdivisions of two-dimensional parametric surfaces such as spheres, tori, cylinders. The implementation is exact, complete, and general, i.e., it can also handle non-linear subdivisions. Like the previous version, the data structure supports modifications of the subdivision, such as insertions and deletions of edges, after the initial preprocessing. A major challenge is to retain the expected O(n logn) preprocessing time while providing the above (deterministic) space and query-time guarantees. We describe efficient preprocessing algorithms, which explicitly verify the length L of the longest query path. However, instead of using L, our implementation is based on the depth D of G. Although we prove that the worst case ratio of D and L is Θ(n/logn), we conjecture, based on our experimental results, that this solution achieves expected O(n logn) preprocessing time.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2012 - 20th Annual European Symposium, Proceedings
Pages611-623
Number of pages13
DOIs
StatePublished - 2012
Event20th Annual European Symposium on Algorithms, ESA 2012 - Ljubljana, Slovenia
Duration: 10 Sep 201212 Sep 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7501 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Annual European Symposium on Algorithms, ESA 2012
Country/TerritorySlovenia
CityLjubljana
Period10/09/1212/09/12

Funding

FundersFunder number
Seventh Framework Programme255827
European Commission
Israel Science Foundation1102/11
Tel Aviv University

    Fingerprint

    Dive into the research topics of 'Improved implementation of point location in general two-dimensional subdivisions'. Together they form a unique fingerprint.

    Cite this