Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Optimal point location in a monotone subdivision
SIAM Journal on Computing
A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
Computing the link center of a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
Polygon visibility algorithms for weak visibility and link distance problems
Polygon visibility algorithms for weak visibility and link distance problems
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Minimum-link paths among obstacles in the plane
SCG '90 Proceedings of the sixth 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
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Collision Free Path Planning for Non-Synchronized Motions
Journal of Intelligent and Robotic Systems
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
IEEE Transactions on Computers
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
Information Processing Letters
| Hi-index | 0.01 |
The link distance between two points inside a simple polygon P is defined to be the minimum number of edges required to form a polygonal path inside P that connects the points. A link furthest neighbor of a point p &Egr; P is a point of P whose link distance is the maximum from p. The link center of P is the collection of points whose link distances to their link furthest neighbors are minimized. We present an &Ogr;(n log n) time and &Ogr;(n) space algorithm for computing the link center of a simple polygon P, where n is the number of vertices of P. This improves the previous &Ogr;(n2) time and space algorithm. Our algorithm essentially sweeps a chord through the polygon and spends &Ogr;(log n) time at each step. We demonstrate that the output of the algorithm, a sequence of sets of chords, is a powerful tool for solving several other link distance problems.