Pages that link to "Item:Q3092218"
From MaRDI portal
The following pages link to An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram (Q3092218):
Displayed 5 items.
- Survivable minimum bottleneck networks (Q904084) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)