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: | V. Chepoi, F. Dragan |
---|---|
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 |
Similar Items
-
The Diameter of the Link Center in a Simple Polygon
by: 江和盛
Published: (2000) -
Optimal rectangular decomposition problems for rectilinear polygons
by: LIU,WEN-QING, et al.
Published: (1989) -
The history of the rectilinear diameter law
by: Simón Reif-Acherman
Published: (2010-01-01) -
BREAKDOWN OF THE LAW OF RECTILINEAR DIAMETER.
by: WEINER, JONATHAN
Published: (1974) -
Rectilinear polygon decomposition algorithms and travelling salesman problem
by: ZENG, YI-DE, et al.
Published: (1987)