Name
Abstract | ||
|---|---|---|
The link distance between two points in a polygon P is defined as the minimum number of line segments inside P needed to connect the two points. The link center of a polygon P is the set of points in P which minimizes the maximum link distance to all points in P . The problem of finding the link center of a simple polygon with n edges has been studied extensively in recent years. Several O( n log n ) time algorithms have been given for this problem. We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link center of a simple rectilinear polygon. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0925-7721(95)00026-7 | Computational Geometry: Theory and Applications |
DocType | Volume | Issue |
Conference | 6 | 3 |
ISSN | Citations | PageRank |
0925-7721 | 6 | 0.69 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bengt J. Nilsson | 1 | 210 | 24.43 |
| Sven Schuierer | 2 | 308 | 29.35 |