Farthest-point Voronoi diagrams in the presence of rectangular obstacles

DOI10.1007/s00453-022-01094-9arXiv2203.03198MaRDI QIDQ6174812

Taehoon Ahn, Chanyang Seo, Hee-Kap Ahn, Mincheol Kim

Publication date: 17 August 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.03198

zbMATH Keywords

obstaclesrectanglesfarthest-point Voronoi diagrams

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Farthest-polygon Voronoi diagrams
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Voronoi diagrams and arrangements
• A sweepline algorithm for Voronoi diagrams
• On the geodesic Voronoi diagram of point sites in a simple polygon
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• The furthest-site geodesic Voronoi diagram
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• The geodesic farthest-point Voronoi diagram in a simple polygon
• The Voronoi diagram of curved objects
• ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
• Optimal Point Location in a Monotone Subdivision
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
• Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons
• Farthest neighbors and center points in the presence of rectngular obstacles
• The geodesic farthest-site Voronoi diagram in a polygonal domain with holes

This page was built for publication: Farthest-point Voronoi diagrams in the presence of rectangular obstacles