An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
On the geodesic Voronoi diagram of point sites in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
An efficient algorithm for link-distance problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Extended grassfire transform on medial axes of 2D shapes
Computer-Aided Design
| Hi-index | 0.00 |
The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized, where the link distance between two points x, y inside P is defined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We prove several geometric properties of the link center and present an algorithm that calculates this set in time &Ogr; (n2), where n is the number of sides of P. We also give an &Ogr;(n log n) algorithm for finding a point x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.