Sorting helps for Voronoi diagrams
From MaRDI portal
Publication:1355725
DOI10.1007/BF02526034zbMath0868.68109MaRDI QIDQ1355725
Publication date: 1997
Published in: Algorithmica (Search for Journal in Brave)
Related Items
Finding the k smallest spanning trees, Sorting helps for Voronoi diagrams, Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms, On the angle restricted nearest neighbor problem, Finding the \(k\) smallest spanning trees, Fast geometric approximation techniques and geometric embedding problems, Computing hereditary convex structures
Cites Work
- Unnamed Item
- Unnamed Item
- A sweepline algorithm for Voronoi diagrams
- Sorting helps for Voronoi diagrams
- There are planar graphs almost as good as the complete graph
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- Finding Minimum Spanning Trees
- Design and implementation of an efficient priority queue
