FURTHEST SITE ABSTRACT VORONOI DIAGRAMS

From MaRDI portal
Publication:4682150

DOI10.1142/S0218195901000663zbMath1074.68643MaRDI QIDQ4682150

Ronald H. Rasch, Kurt Mehlhorn, Stefan Meiser

Publication date: 10 June 2005

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




Related Items

Abstract Voronoi diagrams revisitedA randomized divide and conquer algorithm for higher-order abstract Voronoi diagramsON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAMAn efficient randomized algorithm for higher-order abstract Voronoi diagramsVoronoi diagrams for polygon-offset distance functionsDeletion in abstract Voronoi diagrams in expected linear time and related problemsFarthest-polygon Voronoi diagramsVoronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance FunctionMinimizing the diameter of a spanning tree for imprecise pointsTHE HEAVY LUGGAGE METRICBottleneck detour tree of points on a pathTHE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONSRandomized incremental construction of abstract Voronoi diagramsTight bound and improved algorithm for farthest-color Voronoi diagrams of line segmentsVoronoi diagrams for convex polygon-offset distance functionsConvex-straight-skeleton Voronoi diagrams for segments and convex polygonsMaximum spanning trees in normed planesA fast algorithm for data collection along a fixed trackTHE ANCHORED VORONOI DIAGRAM: STATIC, DYNAMIC VERSIONS AND APPLICATIONSDeletion in Abstract Voronoi Diagrams in Expected Linear Time.Abstract Voronoi Diagrams from Closed Bisecting CurvesABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONSOn the complexity of higher order abstract Voronoi diagramsThe higher-order Voronoi diagram of line segments



Cites Work