Towards an optimal method for dynamic planar point location
From MaRDI portal
Publication:4562277
Recommendations
Cites work
- scientific article; zbMATH DE number 5764825 (Why is no real title available?)
- scientific article; zbMATH DE number 176774 (Why is no real title available?)
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- A fast planar partition algorithm. I
- Computational geometry. Algorithms and applications.
- Computational geometry: a retrospective
- Counting and reporting red/blue segment intersections
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic Point Location in General Subdivisions
- Dynamic Trees and Dynamic Point Location
- Dynamic fractional cascading
- Efficient Point Location in a Convex Spatial Cell-Complex
- Fractional cascading. I: A data structuring technique
- Fully Dynamic Orthogonal Range Reporting on RAM
- Fully Dynamic Point Location in a Monotone Subdivision
- Geometric applications of a randomized optimization technique
- New Results on Dynamic Planar Point Location
- On dynamic range reporting in one dimension
- Optimal External Memory Interval Management
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Orthogonal range searching on the RAM, revisited
- Preserving order in a forest in less than logarithmic time and linear space
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(35)- A space-efficient framework for dynamic point location
- Persistent predecessor search and orthogonal point location on the word RAM
- Locating Objects in the Plane Using Global Optimization Techniques
- scientific article; zbMATH DE number 1617272 (Why is no real title available?)
- IMPLICIT POINT LOCATION IN ARRANGEMENTS OF LINE SEGMENTS, WITH AN APPLICATION TO MOTION PLANNING
- Dynamic planar point location with optimal query time (extended abstract)
- A modificated chain method for point location problem
- An incremental reconstruction method for dynamic planar point location
- Adaptive planar point location
- Adaptive planar point location
- Efficient Point Location in a Convex Spatial Cell-Complex
- Dynamic point location in arrangements of hyperplanes
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
- scientific article; zbMATH DE number 437528 (Why is no real title available?)
- Dynamic planar point location with optimal query time
- Adaptive point location in planar convex subdivisions
- Fully Dynamic Point Location in a Monotone Subdivision
- Dynamic 3-sided planar range queries with expected doubly logarithmic time
- Distance-Sensitive Planar Point Location
- Dynamic planar point location with sub-logarithmic local updates
- Dynamic Distribution-Sensitive Point Location
- Accuracy characterization and measurement point planning for workpiece localization
- On the dynamization of data structures
- Point location in dynamic planar subdivisions
- A robust backward search method based on walk-through for point location on a 3D surface mesh
- A simple entropy-based algorithm for planar point location
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Dynamic Distribution-Sensitive Point Location
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- On the Exact Worst Case Query Complexity of Planar Point Location
- A dynamic fixed windowing problem
- A static optimality transformation with applications to planar point location
- Persistent predecessor search and orthogonal point location on the word RAM
- Dynamic planar orthogonal point location in sublogarithmic time
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data
This page was built for publication: Towards an optimal method for dynamic planar point location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562277)
