Shortest watchman routes in simple polygons
Discrete & Computational Geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
An optimal algorithm for the two-guard problem
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Bushiness and a tight worst-case upper bound on the search number of a simple polygon
Information Processing Letters
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On Hamiltonian Triangulations in Simple Polygons (Extended Abstract)
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Visibility-Based Pursuit-Evasion in a Polygonal Environment
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Constructing Shortest Watchman Routes by Divide-and-Conquer
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
An algorithm for searching a polygonal region with a flashlight
Proceedings of the sixteenth annual symposium on Computational geometry
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Algorithms for Searching a Polygonal Room with a Door
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Characterization of Rooms Searchable by Two Guards
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Searching a Simple Polygon by a k-Searcher
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Searching a polygonal region by a group of stationary k-searchers
Information Processing Letters
Sweeping simple polygons with the minimum number of chain guards
Information Processing Letters
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
The Two-Guard Polygon Walk Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
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
Studying the stochastic capturing of moving intruders by mobile sensors
Computers & Mathematics with Applications
| Hi-index | 0.00 |