Koenderink and van Doorn introduced aspect graphs as a way of representing 3-D shape for object recognition. 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. The viewing data of an object is the partition of the gaussian sphere together with a representative line drawings for each region of the partition. In this paper we present an algorithm to compute the viewing data of polyhedral objects. In the course of presenting the algorithm, we provide a full catalog of the visual events that occur for this type of objects.
Title
Computing The Aspect Graph for Line Drawings of Polyhedral Objects
Published
1988-02-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-88-402
Type
Text
Extent
28 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
