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
Optimal Algorithms for Two-Guard Walkability of Simple Polygons
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
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
An optimal competitive strategy for walking in streets
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Linear-Time 2-approximation algorithm for the watchman route problem
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A characterization of polygonal regions searchable from the boundary
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
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 |