Adaptive Point Location in Planar Convex Subdivisions
From MaRDI portal
Publication:5370568
DOI10.1142/S0218195917600019zbMATH Open1372.68259OpenAlexW2785088628MaRDI QIDQ5370568FDOQ5370568
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
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
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Self-adjusting binary search trees
- Expected asymptotically optimal planar point location
- Distance-sensitive planar point location
- A simple entropy-based algorithm for planar point location
- Entropy, triangulation, and point location in planar subdivisions
- Optimal Search in Planar Subdivisions
- Optimal Expected-Case Planar Point Location
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Optimal Point Location in a Monotone Subdivision
- A fast planar partition algorithm. I
- A New Approach to Planar Point Location
- Location of a Point in a Planar Subdivision and Its Applications
- Title not available (Why is that?)
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Title not available (Why is that?)
- Proximate planar point location
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Optimal Point Location in a Monotone Subdivision
- Distance-sensitive planar point location
- On the Exact Worst Case Query Complexity of Planar Point Location
- Adaptive planar point location
- Adaptive planar point location
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Adaptive point location in planar convex subdivisions
- Point Location in Incremental Planar Subdivisions.
- Improved implementation of point location in general two-dimensional subdivisions
- Efficient Point Location in a Convex Spatial Cell-Complex
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)
