Adaptive Point Location in Planar Convex Subdivisions

DOI10.1142/S0218195917600019MaRDI QIDQ5370568zbMATH OpenOpenAlexFDO

Authors Siu-Wing Cheng, Man-Kit Lau

Publication date 20 October 2017

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195917600019

zbMATH Keywords

point locationconvex subdivisionadaptive data structure

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Adaptive point location in planar convex subdivisions
• Point location in dynamic planar subdivisions
• Point Location in Incremental Planar Subdivisions.
• Adaptive planar point location
• Adaptive planar point location
• Two- and three- dimensional point location in rectangular subdivisions
• Optimal Point Location in a Monotone Subdivision
• scientific article; zbMATH DE number 1305387
• Improved implementation of point location in general two-dimensional subdivisions
• PLANAR POINT LOCATION REVISITED

Cites work

• scientific article; zbMATH DE number 1617272 (Why is no real title available?)
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 1220053 (Why is no real title available?)
• scientific article; zbMATH DE number 1303604 (Why is no real title available?)
• scientific article; zbMATH DE number 6321467 (Why is no real title available?)
• A New Approach to Planar Point Location
• A fast planar partition algorithm. I
• A new point-location algorithm and its practical efficiency: comparison with existing algorithms
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• A simple entropy-based algorithm for planar point location
• Computational geometry. Algorithms and applications.
• Distance-sensitive planar point location
• Entropy, triangulation, and point location in planar subdivisions
• Expected asymptotically optimal planar point location
• Location of a Point in a Planar Subdivision and Its Applications
• Optimal Expected-Case Planar Point Location
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Proximate planar point location
• Self-adjusting binary search trees
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time

Cited in

(10)

• Distance-sensitive planar point location
• Adaptive planar point location
• Adaptive planar point location
• Efficient Point Location in a Convex Spatial Cell-Complex
• Adaptive point location in planar convex subdivisions
• Improved implementation of point location in general two-dimensional subdivisions
• Point Location in Incremental Planar Subdivisions.
• Optimal Point Location in a Monotone Subdivision
• Optimal randomized incremental construction for guaranteed logarithmic planar point location
• On the Exact Worst Case Query Complexity of Planar Point Location

This page was built for publication: Adaptive Point Location in Planar Convex Subdivisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370568)