Translating polygons in the plane
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
Visibility and intersectin problems in plane geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
An optimal parallel algorithm for detecting weak visibility of a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Finding the shortest boundary guard of a simple polygon
Theoretical Computer Science
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Finding all weakly-visible chords of a polygon in linear time
Nordic Journal of Computing
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
A new lower bound for evaluating the performances of sensor location algorithms
Pattern Recognition Letters
| Hi-index | 14.98 |
Notation and a theorem are presented which, using a result of B. Chazelle and L.J. Guibas (1985), enable the authors to design an O(n log n) algorithm for reporting all visibility edges of a given n-vertex polygon. Improving on this bound to O(n) is presently focused upon. This problem is solved for polygons with at least one given visibility edge. It is assumed that both endpoints of this edge are convex vertices. Subsequently, it is shown how to drop this restriction. The general case of detecting weak edge visibility of an arbitrary simple polygon is dealt with.