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
Hi-index | 0.00 |