Rectilinear link diameter and radius in a rectilinear polygonal domain

Abstract We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of n vertices and h holes. We introduce a graph of oriented distances to encode the distance between pairs of points of the domain. This helps us transform the problem so that we can search through the candidates more efficiently. Our algorithm computes both the diameter and the radius in O ( min ⁡ ( n ω , n 2 + n h log ⁡ h + χ 2 ) ) time, where ω 2.373 denotes the matrix multiplication exponent and χ ∈ Ω ( n ) ∩ O ( n 2 ) is the number of edges of the graph of oriented distances. We also provide an alternative algorithm for computing the diameter that runs in O ( n 2 log ⁡ n ) time.

[1]  Andrzej Lingas,et al.  AnO(n logn) algorithm for computing the link center of a simple polygon , 1992, Discret. Comput. Geom..

[2]  Haim Kaplan,et al.  Optimal dynamic vertical ray shooting in rectilinear planar subdivisions , 2007, SODA '07.

[3]  Prosenjit Bose,et al.  A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon , 2015, Discret. Comput. Geom..

[4]  Timothy M. Chan,et al.  All-Pairs Shortest Paths in Geometric Intersection Graphs , 2017, WADS.

[5]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[6]  Joseph S. B. Mitchell,et al.  L1 shortest paths among polygonal obstacles in the plane , 1992, Algorithmica.

[7]  Joseph S. B. Mitchell,et al.  An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains , 2015, Algorithmica.

[8]  Haitao Wang,et al.  On the Geodesic Centers of Polygonal Domains , 2016, ESA.

[9]  Liam Roditty,et al.  Fast approximation algorithms for the diameter and radius of sparse graphs , 2013, STOC '13.

[10]  Bengt J. Nilsson,et al.  An Optimal Algorithm for the Rectilinear Link Center of a Rectilinear Polygon , 1996, Comput. Geom..

[11]  Maarten Löffler,et al.  On the complexity of minimum-link path problems , 2016, J. Comput. Geom..

[12]  Subhash Suri,et al.  Computing Geodesic Furthest Neighbors in Simple Polygons , 1989, J. Comput. Syst. Sci..

[13]  Virginia Vassilevska Williams,et al.  Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.

[14]  Joseph S. B. Mitchell,et al.  Minimum-link paths revisited , 2013, Comput. Geom..

[15]  Yoshio Okamoto,et al.  Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain , 2018, ISAAC.

[16]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[17]  Sang Won Bae,et al.  Computing the $$L_1$$L1 Geodesic Diameter and Center of a Polygonal Domain , 2017, Discret. Comput. Geom..

[18]  Joshua R. Wang,et al.  Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs , 2016, SODA.

[19]  Subhash Suri,et al.  Matrix Searching with the Shortest-Path Metric , 1997, SIAM J. Comput..

[20]  Sang Won Bae,et al.  Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time , 2015, Comput. Geom..

[21]  Bengt J. Nilsson,et al.  Computing the Rectilinear Link Diameter of a Polygon , 1991, Workshop on Computational Geometry.

[22]  Sang Won Bae,et al.  The Geodesic Diameter of Polygonal Domains , 2010, Discrete & Computational Geometry.