Pages that link to "Item:Q340524"
From MaRDI portal
The following pages link to A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524):
Displaying 6 items.
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. (Q3132855) (← 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)
