Pages that link to "Item:Q2207601"
From MaRDI portal
The following pages link to Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601):
Displaying 12 items.
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Swap conditions for dynamic Voronoi diagrams for circles and line segments (Q1274463) (← links)
- (Q4411393) (← links)
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications (Q4575914) (← links)
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points (Q4991375) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
- An algorithmic framework for the single source shortest path problem with applications to disk graphs (Q6101843) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
