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 条

[11] Generating Realistic Roofs over a Rectilinear Polygon
Ahn, Hee-Kap
Bae, Sang Won
Knauer, Christian
Lee, Mira
Shin, Chan-Su
Vigneron, Antoine
ALGORITHMS AND COMPUTATION, 2011, 7074 : 60 - +
[12] The smallest pair of noncrossing paths in a rectilinear polygon
Yang, CD
Lee, DT
Wong, CK
IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (08) : 930 - 941
[13] An efficient algorithm to decompose a compound rectilinear shape into simple rectilinear shapes
Sharif, Imran
Chaudhuri, Debasis
Kushwaha, Naveen
Samal, Ashok
Singh, Brij Mohan
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2018, 26 (01) : 150 - 161
[14] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Joseph S. B. Mitchell
Valentin Polishchuk
Mikko Sysikaski
Haitao Wang
Algorithmica, 2019, 81 : 289 - 316
[15] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Mitchell, Joseph S. B.
Polishchuk, Valentin
Sysikaski, Mikko
Wang, Haitao
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 947 - 959
[16] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Mitchell, Joseph S. B.
Polishchuk, Valentin
Sysikaski, Mikko
Wang, Haitao
ALGORITHMICA, 2019, 81 (01) : 289 - 316
[17] MINIMUM DISSECTION OF A RECTILINEAR POLYGON WITH ARBITRARY HOLES INTO RECTANGLES
SOLTAN, V
GORPINEVICH, A
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (01) : 57 - 79
[18] Complexities of efficient solutions of rectilinear polygon cover problems
P. Berman
B. DasGupta
Algorithmica, 1997, 17 : 331 - 356
[19] Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
Dept. of Comp. Sci. and Engineering, Pennsylvania State University, University Park, PA 16802, United States
不详
Algorithmica (New York), 4 (331-356):
[20] Complexities of efficient solutions of rectilinear polygon cover problems
Berman, P
DasGupta, B
ALGORITHMICA, 1997, 17 (04) : 331 - 356

← 1 2 3 4 5 →