Farthest neighbors and center points in the presence of rectngular obstacles

DOI10.1145/378583.378657zbMath1377.68260OpenAlexW1983473865MaRDI QIDQ5361573

Joseph S. B. Mitchell, Boaz Ben-Moshe, Matthew J. Katz

Publication date: 29 September 2017

Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/378583.378657

zbMATH Keywords

shortest pathsfacility locationapproximation algorithmsgeodesic pathsfarthest neighbors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Data structures (68P05) Approximation algorithms (68W25)

Related Items (8)

Dominating sets for rectilinear center location problems with polyhedral barriers ⋮ An efficient solution method for Weber problems with barriers based on genetic algorithms ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ Algebraic properties of location problems with one circular barrier. ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ All Farthest Neighbors in the Presence of Highways and Obstacles ⋮ A wavefront approach to center location problems with barriers ⋮ Planar location problems with block distance and barriers

This page was built for publication: Farthest neighbors and center points in the presence of rectngular obstacles