학술논문

Computing occlusion-free viewpoints
Document Type
Periodical
Source
IEEE Transactions on Pattern Analysis and Machine Intelligence IEEE Trans. Pattern Anal. Mach. Intell. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 18(3):279-292 Mar, 1996
Subject
Computing and Processing
Bioengineering
Sensor phenomena and characterization
Cameras
Robot vision systems
Solids
Machine vision
Optical sensors
Robot sensing systems
Optical control
Geometry
Computer vision
Language
ISSN
0162-8828
2160-9292
1939-3539
Abstract
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.