The L∞ Hausdorff Voronoi Diagram Revisited
From MaRDI portal
Publication:3449121
DOI10.1142/S0218195915500089zbMATH Open1343.68264MaRDI QIDQ3449121FDOQ3449121
Authors: Evanthia Papadopoulou, Jinhui Xu
Publication date: 3 November 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
- On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\).
- scientific article; zbMATH DE number 2133763
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms
- Voronoi's conjecture for contractions of Dirichlet-Voronoi cells of lattices
- A new duality result concerning Voronoi diagrams
- A new duality result concerning Voronoi diagrams
- On the Hausdorff Voronoi diagram of point clusters in the plane.
- On the Voronoi Regions of Certain Lattices
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- A generalization of Voronoi's theorem to algebraic lattices
Cites Work
- On the farthest line-segment Voronoi diagram
- Farthest-polygon Voronoi diagrams
- Abstract Voronoi diagrams revisited
- A sweepline algorithm for Voronoi diagrams
- The upper envelope of Voronoi surfaces and its applications
- Randomized incremental construction of abstract Voronoi diagrams
- Priority Search Trees
- A combinatorial property of convex sets
- The Hausdorff Voronoi diagram of point clusters in the plane
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
- Computing the map of geometric minimal cuts
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
- The upper envelope of piecewise linear functions: Algorithms and applications
- Optimal computation of the Voronoi diagram of disjoint clusters
Cited In (4)
This page was built for publication: The L∞ Hausdorff Voronoi Diagram Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449121)