Dynamic planar orthogonal point location in sublogarithmic time
From MaRDI portal
Publication:5115793
DOI10.4230/LIPICS.SOCG.2018.25zbMATH Open1489.68347MaRDI QIDQ5115793FDOQ5115793
Authors: Timothy M. Chan, Konstantinos Tsakalidis 
Publication date: 18 August 2020
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- 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
- Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
- Dynamic ordered sets with exponential search trees
- Design and implementation of an efficient priority queue
- Dynamic fractional cascading
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Optimal External Memory Interval Management
- Title not available (Why is that?)
- Dynamic LCA Queries on Trees
- On dynamic range reporting in one dimension
- Geometric applications of a randomized optimization technique
- Title not available (Why is that?)
- Towards an Optimal Method for Dynamic Planar Point Location
- Title not available (Why is that?)
- Fully Dynamic Orthogonal Range Reporting on RAM
- Title not available (Why is that?)
- Amortized Bounds for Dynamic Orthogonal Range Reporting
- An optimal dynamic data structure for stabbing-semigroup queries
- A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
- Dynamic Ray Stabbing
- Dynamic range reporting in external memory
- Dynamic Orthogonal Range Searching on the RAM, Revisited
Cited In (7)
- Dynamic Planar Point Location in External Memory.
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
- Lower bounds for expected-case planar point location
- Dynamic planar point location with optimal query time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random access in persistent strings and segment selection
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)
