Journal of Algorithms
Planning for complete sensor coverage in inspection
Computer Vision and Image Understanding
A survey of automated visual inspection
Computer Vision and Image Understanding
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
View planning for automated three-dimensional object reconstruction and inspection
ACM Computing Surveys (CSUR)
Guarding Galleries and Terrains
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Heuristics for the Generation of Random Polygons
Proceedings of the 8th Canadian Conference on Computational Geometry
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Computer Vision and Image Understanding - Special issue on omnidirectional vision and camera networks
Guarding galleries and terrains
Information Processing Letters
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem
SIBGRAPI '07 Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
SIGITE '08 Proceedings of the 9th ACM SIGITE conference on Information technology education
Towards an Iterative Algorithm for the Optimal Boundary Coverage of a 3D Environment
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Automatic sensor placement for model-based robot vision
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
Guarding thin orthogonal polygons is hard
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |
The problem of locating visual sensors can be often modelled as 2D Art Gallery problems. In particular, tasks such as surveillance require observing the interior of a polygonal environment (interior covering, IC), while for inspection or image based rendering observing the boundary (edge covering, EC) is sufficient. Both problems are NP-hard, and no technique is known for transforming one problem into the other. Recently, an incremental algorithm for EC has been proposed, and its near-optimality has been demonstrated experimentally. In this paper we show that, with some modification, the algorithm is nearly optimal also for IC. The algorithm has been implemented and tested over several hundreds of random polygons with and without holes. The cardinality of the solutions provided is very near to, or coincident with, a polygon specific lower bound, and then suboptimal or optimal. In addition, our algorithm has been compared, for all the test polygons, with recent heuristic sensor location algorithms. In all cases, the cardinality of the set of guards provided by our algorithm was less than or equal to that of the set computed by the other algorithms. An enhanced version of the algorithm, also taking into account range and incidence constraints, has also been implemented.