FURTHEST SITE ABSTRACT VORONOI DIAGRAMS

DOI10.1142/S0218195901000663MaRDI QIDQ4682150zbMATH OpenFDO

Authors K. Mehlhorn, Stefan Meiser, Ronald H. Rasch

Publication date 10 June 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195901000663

zbMATH Keywords

Furthest site Voronoi diagramrandomized incremental constructiontopological properties

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the construction of abstract Voronoi diagrams
• scientific article; zbMATH DE number 18530
• scientific article; zbMATH DE number 4098181
• Farthest-Polygon Voronoi Diagrams
• Farthest-polygon Voronoi diagrams

Cites work

• Applications of random sampling in computational geometry. II
• Applications of random sampling to on-line algorithms in computational geometry
• Voronoi diagrams and arrangements
• Voronoi diagrams from convex hulls

Cited in

(31)

• The weighted farthest color Voronoi diagram on trees and graphs.
• Minimizing the diameter of a spanning tree for imprecise points
• Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
• Maximum spanning trees in normed planes
• Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
• On the complexity of higher order abstract Voronoi diagrams
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams
• The higher-order Voronoi diagram of line segments
• A radius of robust feasibility for uncertain farthest Voronoi cells
• On the farthest line-segment Voronoi diagram
• Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
• Abstract Voronoi diagrams from closed bisecting curves
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
• THE HEAVY LUGGAGE METRIC
• Fuzzy Voronoi Diagram
• scientific article; zbMATH DE number 3945378 (Why is no real title available?)
• The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
• Voronoi diagrams for polygon-offset distance functions
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
• Abstract Voronoi diagrams with disconnected regions
• THE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONS
• Voronoi diagrams for convex polygon-offset distance functions
• Deletion in abstract Voronoi diagrams in expected linear time and related problems
• Farthest-polygon Voronoi diagrams
• Bottleneck detour tree of points on a path
• Randomized incremental construction of abstract Voronoi diagrams
• A coreset for approximate furthest-neighbor queries in a simple polygon
• The farthest color Voronoi diagram in the plane
• Higher-order color Voronoi diagrams and the colorful Clarkson-Shor framework
• A fast algorithm for data collection along a fixed track
• Abstract Voronoi diagrams revisited

This page was built for publication: FURTHEST SITE ABSTRACT VORONOI DIAGRAMS

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