On link diameter of a simple rectilinear polygon
The rectilinear link distance between two points inside a simple rectilinear polygon P is defined to be the minimum number of edges of a path consisting of axis-parallel segments lying inside P. The link diameter of P is the maximum link distance between two points of P. We present an O(n) time algo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1993-12-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp62-74).pdf |
| id |
doaj-4047304fd0f843f685aca89b25585751 |
|---|---|
| record_format |
Article |
| spelling |
doaj-4047304fd0f843f685aca89b255857512020-11-24T22:18:00ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40421993-12-0113(3)6274On link diameter of a simple rectilinear polygonV. Chepoi0F. Dragan1Moldavian University, A.Mateevici str. 60, Department of Mathematics and Cybernetics, Kishinev, 277009, MoldovaMoldavian University, A.Mateevici str. 60, Department of Mathematics and Cybernetics, Kishinev, 277009, MoldovaThe rectilinear link distance between two points inside a simple rectilinear polygon P is defined to be the minimum number of edges of a path consisting of axis-parallel segments lying inside P. The link diameter of P is the maximum link distance between two points of P. We present an O(n) time algorithm for computing the link diameter of a simple rectilinear polygon P, where n is the number of vertices of P. This improves the previous O(nlogn) time algorithm. http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp62-74).pdf |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
V. Chepoi F. Dragan |
| spellingShingle |
V. Chepoi F. Dragan On link diameter of a simple rectilinear polygon Computer Science Journal of Moldova |
| author_facet |
V. Chepoi F. Dragan |
| author_sort |
V. Chepoi |
| title |
On link diameter of a simple rectilinear polygon |
| title_short |
On link diameter of a simple rectilinear polygon |
| title_full |
On link diameter of a simple rectilinear polygon |
| title_fullStr |
On link diameter of a simple rectilinear polygon |
| title_full_unstemmed |
On link diameter of a simple rectilinear polygon |
| title_sort |
on link diameter of a simple rectilinear polygon |
| publisher |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova |
| series |
Computer Science Journal of Moldova |
| issn |
1561-4042 |
| publishDate |
1993-12-01 |
| description |
The rectilinear link distance between two points inside a simple rectilinear polygon P is defined to be the minimum number of edges of a path consisting of axis-parallel segments lying inside P. The link diameter of P is the maximum link distance between two points of P. We present an O(n) time algorithm for computing the link diameter of a simple rectilinear polygon P, where n is the number of vertices of P. This improves the previous O(nlogn) time algorithm. |
| url |
http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n3/v1-n3-(pp62-74).pdf |
| work_keys_str_mv |
AT vchepoi onlinkdiameterofasimplerectilinearpolygon AT fdragan onlinkdiameterofasimplerectilinearpolygon |
| _version_ |
1725783429771952128 |