Intermediate data structures for display algorithms

M.L.P. Lierop, van

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


This paper describes two algorithms and implicit data structures to display 3D scenes composed of polygons on a raster device. Both algorithms are based on the so-called painter’s technique; the first one uses a depthsort algorithm for the visible surface calculation a la Newell, Newell, and Sancha ([l]), the other one uses a priority tree as proposed by Fuchs, Kedem, and Naylor ([2]).

Both algorithms were designed to be used in interactive applications. In order to update an image on the screen as fast as possible and to prevent the recomputation of the whole image after a change in the scene has occurred, an intermediate representation of the scene is needed. This intermediate representation might also be of use in detecting which polygon is meant when a pixel on the screen is pointed at.

For both display algorithms some intermediate representations will be considered, as well as the implications of alterations in the scene upon both these representations and their display.
Original languageEnglish
Title of host publicationDatastructures for raster graphics (Proceedings, Steensel, The Netherlands, June 24-28, 1985)
EditorsL.R.A. Kessener, F.J. Peters, M.L.P. Lierop, van
Place of PublicationBerlin
Number of pages17
ISBN (Electronic)978-3-642-71071-1
ISBN (Print)978-3-642-71073-5
Publication statusPublished - 1986


Dive into the research topics of 'Intermediate data structures for display algorithms'. Together they form a unique fingerprint.

Cite this