Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
Covering orthogonal polygons with star polygons: the perfect graph approach
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Guarding galleries and terrains
Information Processing Letters
Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
On Some City Guarding Problems
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
Robot Formations for Area Coverage
ICIRA '09 Proceedings of the 2nd International Conference on Intelligent Robotics and Applications
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Linear-time 3-approximation algorithm for the r-star covering problem
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Computational Geometry: Theory and Applications
On guarding rectilinear domains
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A 4-approximation algorithm for guarding 1.5-dimensional terrains
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximating a Shortest Watchman Route
Fundamenta Informaticae
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |