Computing the Aspect Graph for Line Drawings of Polyhedral Objects
Abstract
J.J. Koenderink and A.J. van Doorn (1979) 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 are the partition of the Gaussian sphere together with representative line drawings for each region of the partition. The authors present an algorithm for computing the viewing data of polyhedral objects. In the course of presenting the algorithm, they provide a full catalog of the visual events that occur for this type of object.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Gigus and Malik. "Computing the Aspect Graph for Line Drawings of Polyhedral Objects." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196306Markdown
[Gigus and Malik. "Computing the Aspect Graph for Line Drawings of Polyhedral Objects." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/gigus1988cvpr-computing/) doi:10.1109/CVPR.1988.196306BibTeX
@inproceedings{gigus1988cvpr-computing,
title = {{Computing the Aspect Graph for Line Drawings of Polyhedral Objects}},
author = {Gigus, Ziv and Malik, Jitendra},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1988},
pages = {654-661},
doi = {10.1109/CVPR.1988.196306},
url = {https://mlanthology.org/cvpr/1988/gigus1988cvpr-computing/}
}