Dynamic planar orthogonal point location in sublogarithmic time
From MaRDI portal
Publication:5115793
Recommendations
Cites work
- scientific article; zbMATH DE number 5764825 (Why is no real title available?)
- scientific article; zbMATH DE number 140460 (Why is no real title available?)
- scientific article; zbMATH DE number 2079392 (Why is no real title available?)
- scientific article; zbMATH DE number 6861957 (Why is no real title available?)
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- A dynamic stabbing-max data structure with sub-logarithmic query time
- Amortized bounds for dynamic orthogonal range reporting
- An optimal dynamic data structure for stabbing-semigroup queries
- Design and implementation of an efficient priority queue
- Dynamic LCA Queries on Trees
- Dynamic Ray Stabbing
- Dynamic fractional cascading
- Dynamic ordered sets with exponential search trees
- Dynamic orthogonal range searching on the RAM, revisited
- Dynamic range reporting in external memory
- Fully Dynamic Orthogonal Range Reporting on RAM
- Geometric applications of a randomized optimization technique
- On dynamic range reporting in one dimension
- Optimal External Memory Interval Management
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Persistent predecessor search and orthogonal point location on the word RAM
- Preserving order in a forest in less than logarithmic time and linear space
- The buffer tree: A technique for designing batched external data structures
- The design of dynamic data structures
- Towards an optimal method for dynamic planar point location
Cited in
(12)- scientific article; zbMATH DE number 2079392 (Why is no real title available?)
- Persistent predecessor search and orthogonal point location on the word RAM
- Amortized bounds for dynamic orthogonal range reporting
- Dynamic orthogonal range searching on the RAM, revisited
- Dynamic Planar Point Location in External Memory.
- Towards an optimal method for dynamic planar point location
- scientific article; zbMATH DE number 1779434 (Why is no real title available?)
- Dynamic planar point location with optimal query time
- Lower bounds for expected-case planar point location
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Random access in persistent strings and segment selection
- Persistent predecessor search and orthogonal point location on the word RAM
This page was built for publication: Dynamic planar orthogonal point location in sublogarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115793)
