## Visibility, Occlusion, and the Aspect Graph (1987)

Citations: | 88 - 7 self |

### BibTeX

@MISC{Plantinga87visibility,occlusion,,

author = {Harry Plantinga and Charles R. Dyer},

title = {Visibility, Occlusion, and the Aspect Graph},

year = {1987}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we study 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. In this paper 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 Q(n 2 ) and Q (n 6 ) under an orthographic projection viewing model and of Q(n 3 ) and Q(n 9 ) 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...