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

被引：2
|
作者：
Katz, Matthew J. [1 ]
Morgenstern, Gila [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
来源：
INFORMATION PROCESSING LETTERS | 2011年 / 111卷 / 03期
关键词：
Computational geometry; Combinatorial geometry; Rectilinear link-distance; ALGORITHM;
D O I：
10.1016/j.ipl.2010.11.007
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：103 / 106
页数：4
相关论文
共 50 条
12345