Farthest-polygon Voronoi diagrams

DOI10.1016/J.COMGEO.2010.11.004MaRDI QIDQ632728zbMATH OpenOpenAlexFDO

Authors Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Hyeon-Suk Na, Otfried Cheong, Mira Lee

Publication date 25 March 2011

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2010.11.004

zbMATH Keywords

algorithmcomplexityVoronoi diagramgraphical examples

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Farthest-Polygon Voronoi Diagrams
• Farthest line segment Voronoi diagrams
• On the farthest line-segment Voronoi diagram
• On the Farthest Line-Segment Voronoi Diagram
• The furthest-site geodesic Voronoi diagram
• On farthest Voronoi cells
• The geodesic farthest-point Voronoi diagram in a simple polygon
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• scientific article; zbMATH DE number 1424293

Cites work

• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 1424293 (Why is no real title available?)
• A fast planar partition algorithm. I
• A sweepline algorithm for Voronoi diagrams
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computational geometry. Algorithms and applications.
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• Farthest line segment Voronoi diagrams
• Optimal Point Location in a Monotone Subdivision
• The Hausdorff Voronoi diagram of point clusters in the plane
• The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
• The upper envelope of Voronoi surfaces and its applications
• Voronoi diagram for services neighboring a highway
• Über Eine Verallgemeinerung Auf die Kugelfläche Eines Topologischen Satzes von Helly

Cited in

(22)

• On farthest Voronoi cells
• The higher-order Voronoi diagram of line segments
• An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
• Voronoi diagrams for convex polygon-offset distance functions
• Abstract Voronoi diagrams from closed bisecting curves
• The weighted farthest color Voronoi diagram on trees and graphs.
• On farthest Bregman Voronoi cells
• Improved separated red-blue center clustering
• Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
• Stabbing circles for sets of segments in the plane
• Euclidean farthest-point Voronoi diagram of a digital edge
• On the farthest line-segment Voronoi diagram
• On the Farthest Line-Segment Voronoi Diagram
• Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
• Farthest-Polygon Voronoi Diagrams
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
• The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
• A radius of robust feasibility for uncertain farthest Voronoi cells
• Minimizing the diameter of a spanning tree for imprecise points
• The L∞ Hausdorff Voronoi Diagram Revisited
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS

This page was built for publication: Farthest-polygon Voronoi diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632728)