An optimal algorithm for finding all visible edges in a simple polygon
- 1 April 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 5 (2) , 202-207
- https://doi.org/10.1109/70.88040
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- 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
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978