International Journal of Computer Vision

, Volume 5, Issue 2, pp 137–160

Visibility, occlusion, and the aspect graph

Authors

  • Harry Plantinga
    • Department of Computer ScienceUniversity of Pittsburgh
  • Charles R. Dyer
    • Department of Computer ScienceUniversity of Wisconsin-Madison
Article

DOI: 10.1007/BF00054919

Cite this article as:
Plantinga, H. & Dyer, C.R. Int J Comput Vision (1990) 5: 137. doi:10.1007/BF00054919

Abstract

This chapter studies the ways in which the topology of the image of a polyhedron changes with changing viewpoint. We catalog the ways that the topological appearance, or aspect, can change. This enables us to find maximal regions of viewpoints of the same aspect. We use these techniques to construct the viewpoint space partition (VSP), a partition of viewpoint space into maximal regions of constant aspect, and its dual, the aspect graph. Here, we present tight bounds on the maximum size of the VSP and the aspect graph and give algorithms for their construction, first in the convex case and then in the general case. In particular, we give bounds on the maximum size of θ(n2) and θ(n6) under an orthographic projection viewing model and of θ(n3) and θ(n9) under a perspective viewing model. The algorithms make use of a new representation of the appearance of polyhedra from all viewpoints, called the aspect representation or asp. We believe that this representation is one of the significant contributions of this paper.

Copyright information

© Kluwer Academic Publishers 1990