Advertisement

Simple Hidden Line and Surface Algorithms

Chapter
  • 24 Downloads
Part of the Macmillan Computer Science Series book series (COMPSS)

Abstract

We are now able to draw wire diagrams representing any scene. We would like, however, to consider solid objects, in which case the facets at the front will obviously restrict the view of the facets (and boundary lines) at the back. In order to produce such a picture we must introduce an algorithm which determines which parts of a surface or line are visible and which are not. Such algorithms are called hidden surface or hidden line algorithms, depending upon their purpose. There are many of these algorithms, some elementary for specially restricted situations, others very sophisticated for viewing general complicated scenes (Sutherland et al., 1974). In this book we shall consider a variety of approaches ranging from the very simplest types in this chapter, to examples of general-purpose algorithms in chapters 12 and 13.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Ian O. Angell and Gareth Griffith 1987

Authors and Affiliations

  1. 1.Department of Information Systems, London School of EconomicsUniversity of LondonLondonUK

Personalised recommendations