Dynamic geometric data structures via shallow cuttings
From MaRDI portal
Publication:2223621
DOI10.1007/s00454-020-00229-5zbMath1462.68029arXiv1903.08387OpenAlexW3044973706MaRDI QIDQ2223621
Publication date: 29 January 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08387
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal partition trees
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- The design of dynamic data structures
- Maintenance of configurations in the plane
- Reporting points in halfspaces
- Efficient partition trees
- On range searching with semialgebraic sets
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- A fully dynamic algorithm for planar width
- Dynamic half-space range reporting and its applications
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Dynamic Connectivity: Connecting to Networks and Geometry
- Almost tight upper bounds for vertical decompositions in four dimensions
- Ray Shooting and Parametric Search
- Faster Fully-Dynamic Minimum Spanning Forest
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- Decomposable searching problems I. Static-to-dynamic transformation
- Maintenance of geometric extrema
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Simplex Range Searching and Its Variants: A Review
- Linear Optimization Queries
- Semi-Online Maintenance of Geometric Optima and Measures
- Orthogonal range searching on the RAM, revisited
- On Range Searching with Semialgebraic Sets. II
- Improving memory performance of sorting algorithms
