Abstract
Given k terminals and n axis-parallel rectangular obstacles on the plane, our algorithm finds a plane region R* such that, for any point p in R*, the total length of the k shortest rectilinear paths connecting p and the k terminals without passing through any obstacle is minimum. The algorithm is output-sensitive, and takes O((K+n) log n) time and O(K+n) space if k is a fixed constant, where K is the total number of polygonal vertices of the found region R*.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kusakari, Y., Nishizeki, T. Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals . Algorithmica 35, 225–256 (2003). https://doi.org/10.1007/s00453-002-0997-y
Issue Date:
DOI: https://doi.org/10.1007/s00453-002-0997-y