scientific article; zbMATH DE number 7559224
From MaRDI portal
Publication:5088951
DOI10.4230/LIPIcs.SoCG.2019.24MaRDI QIDQ5088951
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
Dynamic data structures for \(k\)-nearest neighbor queries ⋮ Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications ⋮ Reachability problems for transmission graphs ⋮ Reachability problems for transmission graphs ⋮ Resolving SINR Queries in a Dynamic Setting ⋮ Two approaches to building time-windowed geometric data structures ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
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
- 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
- Semi-Online Maintenance of Geometric Optima and Measures
- Orthogonal range searching on the RAM, revisited
- Correspondence-based data structures for double-ended priority queues
This page was built for publication:
