Settling the bound on the rectilinear link radius of a simple rectilinear polygon

Authors:
Matthew J. Katz;Gila Morgenstern
Affiliations:
Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel;Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel
Venue:
Information Processing Letters
Year:
2011

Citing 7
Cited 0

Computing the link center of a simple polygon

Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
An efficient algorithm for link-distance problems

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
On rectilinear link distance

Computational Geometry: Theory and Applications
An O(n log n) algorithm for computing the link center of a simple polygon

Discrete & Computational Geometry
An optimal algorithm for the rectilinear link center of a rectilinear polygon

Computational Geometry: Theory and Applications
Computing the Rectilinear Link Diameter of a Polygon

CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Minimum link paths in polygons and related problems

Minimum link paths in polygons and related problems

Quantified Score

Hi-index	0.89

Visualization

Abstract

We improve the best known bound on the rectilinear link radius of a simple rectilinear polygon with respect to its rectilinear link diameter. The new bound is tight and is compatible with the known bound on the (regular) link radius of a (regular) simple polygon with respect to its (regular) link diameter. The previous bound on the rectilinear link radius of a simple rectilinear polygon was proven by Nilsson and Schuierer in 1991.