Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Authors:
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4) , 209-233
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Self-adjusting binary search treesJournal of the ACM, 1985
- Computational Geometry1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Data Structures and Algorithms 11984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- A theorem on polygon cutting with applications1982
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978
- Triangulating a simple polygonInformation Processing Letters, 1978