The following pages link to (Q5088951):
Displaying 7 items.
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Reachability problems for transmission graphs (Q5896888) (← links)
- Reachability problems for transmission graphs (Q5918537) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
