Computing Occlusion-Free Viewpoints

This paper presents methods to compute the locus of all viewpoints from which features on known polyhedral objects can be viewed in their entirety without being occluded by anything in the environment. Convex and concave polyhedra with or without holes and the viewing model of perspective projection are employed in this work. Initially, properties of the occlusion-free and occluded loci of viewpoints are determined. Based on these properties, two methods to construct these loci together with their complexity analysis are presented. In the first method, a boundary representation of the occlusion-free locus is obtained. In the second method, the locus of occluded viewpoints is expressed in terms of a constructive solid geometry representation that consists of a union of component solids. Implementation results and comparison of the two methods are given.

[1]  K. Tarabanis,et al.  Planning viewpoints that simultaneously satisfy several feature detectability constraints for robotic vision , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[2]  Peter Kovesi,et al.  Automatic Sensor Placement from Vision Task Requirements , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[4]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..

[5]  Robert M. Haralick,et al.  Automatic sensor and light source positioning for machine vision , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[6]  Raimund Seidel,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[8]  GigusZiv,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991 .

[9]  Roger Y. Tsai,et al.  Viewpoint planning: the visibility constraint , 1989 .

[10]  Konstantinos A. Tarabanis,et al.  Computing viewpoints that satisfy optical constraints , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  Christian Laugier,et al.  Combining vision based information and partial geometric models in automatic grasping , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[12]  Roger Y. Tsai,et al.  Automated sensor planning for robotic vision tasks , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Kevin W. Bowyer,et al.  Creating The Perspective Projection Aspect Graph Of Polyhedral Objects , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[14]  Chris Goad,et al.  Special purpose automatic programming for 3D model-based vision , 1987 .

[15]  Masayoshi Kakikura,et al.  Occlusion avoidance of visual sensors based on a hand-eye action simulator system: HEAVEN , 1987, Adv. Robotics.

[16]  Cregg K. Cowan.  Model-based synthesis of sensor location , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[17]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .