DocumentCode :
1048436
Title :
Computing the aspect graph for line drawings of polyhedral objects
Author :
Gigus, Ziv ; Malik, Jitendra
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume :
12
Issue :
2
fYear :
1990
fDate :
2/1/1990 12:00:00 AM
Firstpage :
113
Lastpage :
122
Abstract :
An algorithm for computing the aspect graph for polyhedral objects is described. The aspects graph is a representation of three-dimensional objects by a set of two-dimensional views. The set of viewpoints on the Gaussian sphere is partitioned into regions such that in each region the qualitative structure of the line drawing remains the same. At the boundaries between adjacent regions are the accidental viewpoints where the structure for the line drawing changes. It is shown that for polyhedral objects there are two fundamental visual events: (1) the projections of an edge and a vertex coincide; and (2) the projections of three nonadjacent edges intersect at a point. The geometry of the object is reflected in the locus of the accidental viewpoints. The algorithm computes the partition together with a representative view for each region of the partition
Keywords :
computational geometry; graph theory; pattern recognition; picture processing; 3D object representation; Gaussian sphere; accidental viewpoints; aspect graph; edge projection; geometry; line drawings; pattern recognition; picture processing; polyhedral objects; vertex; Algorithm design and analysis; Computer science; Geometry; Object recognition; Partitioning algorithms; Shape;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/34.44399
Filename :
44399
Link To Document :
بازگشت