Art gallery theorems and algorithms
Art gallery theorems and algorithms
Integer and combinatorial optimization
Integer and combinatorial optimization
Automatic Sensor Placement from Vision Task Requirements
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special Issue on Industrial Machine Vision and Computer Vision Technology:8MPart
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
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)
Discrete and Computational Geometry (Mathematical Sciences Research Institute Publications)
Discrete and Computational Geometry (Mathematical Sciences Research Institute Publications)
Automatic sensor placement for model-based robot vision
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
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
| Hi-index | 0.00 |
Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present an optimal 3D sensor location algorithms that can locate sensors into a polyhedral environment that are able to see the features of the objects in their entirety. Limitations due to real sensors can be easily taken into account. The algorithm has been implemented, and examples are also given.