Optimal Algorithms for Two-Guard Walkability of Simple Polygons
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics
Surveillance of a polygonal area by a mobile searcher from the boundary: searchability testing
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A linear-time algorithm for finding all door locations that make a room searchable
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
An optimal algorithm for the 1-searchability of polygonal rooms
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Simple characterization of LR-visibility polygons
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Characterizing and recognizing LR-visibility polygons
Discrete Applied Mathematics
| Hi-index | 0.00 |