DocumentCode :
1391115
Title :
Efficiently computing and representing aspect graphs of polyhedral objects
Author :
Gigus, Ziv ; Canny, John ; Seidel, Raimund
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume :
13
Issue :
6
fYear :
1991
fDate :
6/1/1991 12:00:00 AM
Firstpage :
542
Lastpage :
551
Abstract :
An efficient algorithm and a data structure for computing and representing the aspect graph of polyhedral objects under orthographic projection are presented. The aspect graph is an approach to representing 3-D objects by a set of 2-D views, for the purpose of object recognition. In this approach the viewpoint space is partitioned into regions such that in each region the qualitative structure of the line drawing does not change. The viewing data of an object is the partition of the viewpoint space together with a representative view in each region. The algorithm computes the viewing data for line drawings of polyhedral objects under orthographic projection
Keywords :
data structures; graph theory; pattern recognition; aspect graphs; data structure; orthographic projection; pattern recognition; polyhedral objects; viewpoint space; Application software; Computed tomography; Computer science; Computer vision; Data structures; Information retrieval; 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.87341
Filename :
87341
Link To Document :
بازگشت