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

Matthew J. Katz; Gila Morgenstern

doi:https://doi.org/10.1016/j.ipl.2010.11.007

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

Matthew J. Katz, Gila Morgenstern

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Pages (from-to)	103-106
Number of pages	4
Journal	Information Processing Letters
Volume	111
Issue number	3
DOIs	https://doi.org/10.1016/j.ipl.2010.11.007
State	Published - 1 Jan 2011

Keywords

Combinatorial geometry
Computational geometry
Rectilinear link-distance

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

https://doi.org/10.1016/j.ipl.2010.11.007

Cite this

@article{3bc623400a214b9484ea5c1ae0da918a,

title = "Settling the bound on the rectilinear link radius of a simple rectilinear polygon",

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.",

keywords = "Combinatorial geometry, Computational geometry, Rectilinear link-distance",

author = "Katz, {Matthew J.} and Gila Morgenstern",

year = "2011",

month = jan,

day = "1",

doi = "https://doi.org/10.1016/j.ipl.2010.11.007",

language = "American English",

volume = "111",

pages = "103--106",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

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

AU - Katz, Matthew J.

AU - Morgenstern, Gila

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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.

AB - 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.

KW - Combinatorial geometry

KW - Computational geometry

KW - Rectilinear link-distance

UR - http://www.scopus.com/inward/record.url?scp=78349274451&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.ipl.2010.11.007

DO - https://doi.org/10.1016/j.ipl.2010.11.007

M3 - Article

SN - 0020-0190

VL - 111

SP - 103

EP - 106

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this