Pages that link to "Item:Q2354919"
From MaRDI portal
The following pages link to On the complexity of higher order abstract Voronoi diagrams (Q2354919):
Displayed 8 items.
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Degree distributions in \(AB\) random geometric graphs (Q2668250) (← links)
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function (Q2971631) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)