Pages that link to "Item:Q3799631"
From MaRDI portal
The following pages link to An Improved Algorithm for Constructing kth-Order Voronoi Diagrams (Q3799631):
Displayed 16 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)
- The \(k\)-centrum straight-line location problem (Q655169) (← links)
- Finding an Euclidean anti-\(k\)-centrum location of a set of points (Q732894) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Higher order mobile coverage control with applications to clustering of discrete sets (Q1737771) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Voronoi diagrams over dynamic scenes (Q2367408) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
- Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks (Q3223935) (← links)
- Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization (Q3628372) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- A new duality result concerning Voronoi diagrams (Q5899690) (← links)