Adaptive Point Location in Planar Convex Subdivisions

DOI10.1142/S0218195917600019zbMath1372.68259OpenAlexW2785088628MaRDI QIDQ5370568

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

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

Related Items (1)

Adaptive Planar Point Location

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-sensitive planar point location
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Expected asymptotically optimal planar point location
• A fast planar partition algorithm. I
• A simple entropy-based algorithm for planar point location
• Entropy, triangulation, and point location in planar subdivisions
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
• A new point-location algorithm and its practical efficiency: comparison with existing algorithms
• Optimal Point Location in a Monotone Subdivision
• Self-adjusting binary search trees
• A New Approach to Planar Point Location
• Optimal Search in Planar Subdivisions
• Location of a Point in a Planar Subdivision and Its Applications
• Proximate planar point location
• Optimal Expected-Case Planar Point Location

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