Computing the visibility polygon from a convex set and related problems
- 31 March 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (1) , 75-95
- https://doi.org/10.1016/0196-6774(91)90024-s
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Visibility of disjoint polygonsAlgorithmica, 1986
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- Computing the visibility polygon from an edgeComputer Vision, Graphics, and Image Processing, 1986
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- Visibility of a simple polygonComputer Vision, Graphics, and Image Processing, 1983
- 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