On some link distance problems in a simple polygon
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 6 (1), 108-113
- https://doi.org/10.1109/70.88124
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Worst-case optimal algorithms for constructing visibility polygons with holesPublished by Association for Computing Machinery (ACM) ,1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972