Computing the visibility polygon from a convex set and related problems
References (22)
- et al.
A linear algorithm for computing the visibility polygon from a point
J. Algorithms
(1981) - et al.
Finding the convex hull of a simple polygon
J. Algorithms
(1983) Visibility of a simple polygon
Comput. Vision Graphics Image Process
(1983)- et al.
Computing the visibility polygon from an edge
Comput. Vision Graphics Image Process
(1986) A linear time algorithm for minimum link paths inside a simple polygon
Comput. Vision Graphics Image Process
(1986)Shortest path solves edge-to-edge visibility in a polygon
Pattern Recognition Lett.
(1986)- et al.
Finding minimal convex nested polygons
- et al.
Visibility of disjoint polygons
Algorithmica
(1986) - et al.
An optimal algorithm for determining the visibility of a polygon from an edge
IEEE Trans. Comput.
(1981) - et al.
Visibility and intersection problems in plane geometry
Minimum Polygonal Separation
Cited by (56)
Minimum-link paths revisited
2014, Computational Geometry: Theory and ApplicationsWeak visibility polygons of NURBS curves inside simple polygons
2014, Journal of Computational and Applied MathematicsDiffuse reflection diameter and radius for convex-quadrilateralizable polygons
2013, Discrete Applied MathematicsThe Complexity of Geodesic Spanners
2023, arXivConstant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon
2023, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
- ∗
A part of the work was done when the author visited the Center for Automation Research, University of Maryland and was supported by the Air Force Office of Scientific Research under Grant AFOSR-86-0092.
Copyright © 1991 Published by Elsevier Inc.