Pages that link to "Item:Q728495"
From MaRDI portal
The following pages link to Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495):
Displaying 14 items.
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- (Q5088951) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- (Q5874515) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
- Bottleneck matching in the plane (Q6103175) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
