An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
A mobius automation: an application of artificial intelligence techniques
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Characterization of Rooms Searchable by Two Guards
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Local Transformation of Polygons with Visibility Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
IEEE Transactions on Computers
Rotationally monotone polygons
Computational Geometry: Theory and Applications
A new lower bound for evaluating the performances of sensor location algorithms
Pattern Recognition Letters
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Bare hand interface for interaction in the video see-through HMD based wearable AR environment
ICEC'06 Proceedings of the 5th international conference on Entertainment Computing
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Enhancing immersiveness in AR-based product design
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
A new linear algorithm for triangulating monotone polygons
Pattern Recognition Letters
| Hi-index | 14.98 |
In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge are presented. The following computational problem is considered. Given an n-sided simple polygon, is the polygon visible from a specified edge? An O(n), and thus optimal, algorithm is exhibited for determining edge visibility under any of the three definitions. The paper closes with an interesting characterization of visibility and some open problems in this area.