The following pages link to Abstract Voronoi diagrams revisited (Q833716):
Displaying 21 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces (Q662365) (← links)
- Extended box clustering for classification problems (Q724605) (← links)
- A fast algorithm for data collection along a fixed track (Q744105) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
- Abstract Voronoi Diagrams from Closed Bisecting Curves (Q3132921) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- Non-centered Voronoi Skeletons (Q5237081) (← links)
- ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS (Q5261019) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
