Pages that link to "Item:Q2366225"

The following pages link to A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225):

Displaying 11 items.

• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
• Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
• An introduction to randomization in computational geometry (Q1351693) (← links)
• Higher order mobile coverage control with applications to clustering of discrete sets (Q1737771) (← links)
• The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
• Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
• Degree distributions in \(AB\) random geometric graphs (Q2668250) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
• Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay (Q3431202) (← links)
• The edge labeling of higher order Voronoi diagrams (Q6618154) (← links)