Pages that link to "Item:Q3136224"
From MaRDI portal
The following pages link to A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS (Q3136224):
Displaying 15 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Multiple covers with balls. I: Inclusion-exclusion (Q1699285) (← links)
- Voronoi diagrams on the sphere (Q1862122) (← links)
- Separation by convex pseudo-circles (Q2022622) (← links)
- The multi-cover persistence of Euclidean balls (Q2022628) (← links)
- Bivariate B-splines from convex configurations (Q2037190) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← 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)
- CENTROID TRIANGULATIONS FROM k-SETS (Q4650084) (← links)
- The Multi-cover Persistence of Euclidean Balls (Q5115802) (← links)
