Computing occlusion-free viewpoints

被引：67

作者：

Tarabanis, K

Tsai, RY

Kaul, A

机构：

[1] Manufacturing Research, IBM. T.J. Watson Research Center, Yorktown Heights

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1996年 / 18卷 / 03期

关键词：

visibility occlusion; viewpont planning; denser planning; CAD-based vision;

D O I：

10.1109/34.485556

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 (CSG) representation that consists of a union of component solids. Implementation results and comparison of the two methods are given.

引用

页码：279 / 292

页数：14

共 20 条

[1]

[Anonymous], 1987, ART GALLERY THEOREMS

[2]

ARONOV B, 1990, COMBINATORICA, V2

[3]

ARONOV B, 1991, COMMUNICATION

[4]

Cowan C. K., 1988, Proceedings of the 1988 IEEE International Conference on Robotics and Automation (Cat. No.88CH2555-1), P900, DOI 10.1109/ROBOT.1988.12174

[5]

COWAN GK, 1988, IEEE T PATTERN ANAL, V10, P407

[6]

Edelsbrunner H., 1987, ALGORITHMS COMBINATO

[7] EFFICIENTLY COMPUTING AND REPRESENTING ASPECT GRAPHS OF POLYHEDRAL OBJECTS [J].