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 条
  • [41] Diffuse Reflection Radius in a Simple Polygon
    Eli Fox-Epstein
    Csaba D. Tóth
    Andrew Winslow
    Algorithmica, 2016, 76 : 910 - 931
  • [42] A simple linear algorithm for computing rectilinear 3-centers
    Hoffmann, M
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2005, 31 (03): : 150 - 165
  • [43] MINIMUM PARTITIONING SIMPLE RECTILINEAR POLYGONS IN O(NLOGLOGN)-TIME
    LIOU, WT
    TAN, JJM
    LEE, RCT
    PROCEEDINGS OF THE FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY, 1989, : 344 - 353
  • [44] Minimum-link shortest paths for polygons amidst rectilinear obstacles
    Kim, Mincheol
    Ahn, Hee-Kap
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2022, 103
  • [45] QUANTUM STATES OF NEUTRONS BOUND IN THE MAGNETIC-FIELD OF A RECTILINEAR CURRENT
    BLUMEL, R
    DIETRICH, K
    PHYSICAL REVIEW A, 1991, 43 (01): : 22 - 28
  • [46] Improved lower hounds for the link length of rectilinear spanning paths in grids
    Collins, MJ
    Moret, BME
    INFORMATION PROCESSING LETTERS, 1998, 68 (06) : 317 - 319
  • [47] COMPUTING THE LINK CENTER OF A SIMPLE POLYGON
    LENHART, W
    POLLACK, R
    SACK, J
    SEIDEL, R
    SHARIR, M
    SURI, S
    TOUSSAINT, G
    WHITESIDES, S
    YAP, C
    DISCRETE & COMPUTATIONAL GEOMETRY, 1988, 3 (03) : 281 - 293
  • [48] Tight bounds for beacon-based coverage in simple rectilinear polygons
    Bae, Sang Won
    Shin, Chan-Su
    Vigneron, Antoine
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 80 : 40 - 52
  • [49] A method for calculating rectilinear antennas by means of a generalized equivalent circuit: a wire of variable radius
    Kazanskii, LS
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 1998, 43 (02) : 163 - 167
  • [50] Method for calculating rectilinear antennas by means of a generalized equivalent circuit: a wire of variable radius
    Radiotekh Elektron, 2 (175-179):
12345