Issue No. 02 - February (1990 vol. 12)

ISSN: 0162-8828

pp: 113-122

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.44399

ABSTRACT

<p>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.</p>

INDEX TERMS

3D object representation; picture processing; edge projection; pattern recognition; aspect graph; line drawings; polyhedral objects; Gaussian sphere; accidental viewpoints; vertex; geometry; computational geometry; graph theory; pattern recognition; picture processing

CITATION

J. Malik and Z. Gigus, "Computing the Aspect Graph for Line Drawings of Polyhedral Objects," in

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 12, no. , pp. 113-122, 1990.

doi:10.1109/34.44399

CITATIONS