A survey of automated visual inspection
Computer Vision and Image Understanding
Computing Occlusion-Free Viewpoints
IEEE Transactions on Pattern Analysis and Machine Intelligence
View planning for automated three-dimensional object reconstruction and inspection
ACM Computing Surveys (CSUR)
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Automatic Camera Placement for Image-Based Modeling
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Two approximate solutions to the Art Gallery Problem
SIGGRAPH '04 ACM SIGGRAPH 2004 Posters
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
Optimal positioning of sensors in 3d
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
An algorithm for finding a maximum clique in a graph
Operations Research Letters
A nearly optimal algorithm for covering the interior of an Art Gallery
Pattern Recognition
| Hi-index | 0.00 |
This paper presents a new optimal algorithm for locating a set of sensors in 3D able to see the boundaries of a polyhedral environment. Our approach is iterative and is based on a lower bound on the sensors' number and on a restriction of the original problem requiring each face to be observed in its entirety by at least one sensor. The lower bound allows evaluating the quality of the solution obtained at each step, and halting the algorithm if the solution is satisfactory. The algorithm asymptotically converges to the optimal solution of the unrestricted problem if the faces are subdivided into smaller parts.