Intermediate data structures for display algorithms

M.L.P. Lierop, van

doi:10.1007/978-3-642-71071-1_3

Intermediate data structures for display algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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 language	English
Title of host publication	Datastructures for raster graphics (Proceedings, Steensel, The Netherlands, June 24-28, 1985)
Editors	L.R.A. Kessener, F.J. Peters, M.L.P. Lierop, van
Place of Publication	Berlin
Publisher	Springer
Pages	39-55
Number of pages	17
ISBN (Electronic)	978-3-642-71071-1
ISBN (Print)	978-3-642-71073-5
DOIs	https://doi.org/10.1007/978-3-642-71071-1_3
Publication status	Published - 1986

Access to Document

10.1007/978-3-642-71071-1_3

Cite this

@inproceedings{73c1efca59a1497bb67c021235161a79,

title = "Intermediate data structures for display algorithms",

abstract = "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{\textquoteright}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.",

author = "{Lierop, van}, M.L.P.",

year = "1986",

doi = "10.1007/978-3-642-71071-1_3",

language = "English",

isbn = "978-3-642-71073-5",

pages = "39--55",

editor = "L.R.A. Kessener and F.J. Peters and {Lierop, van}, M.L.P.",

booktitle = "Datastructures for raster graphics (Proceedings, Steensel, The Netherlands, June 24-28, 1985)",

publisher = "Springer",

address = "Germany",

}

Intermediate data structures for display algorithms. / Lierop, van, M.L.P.
Datastructures for raster graphics (Proceedings, Steensel, The Netherlands, June 24-28, 1985). ed. / L.R.A. Kessener; F.J. Peters; M.L.P. Lierop, van. Berlin: Springer, 1986. p. 39-55.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Intermediate data structures for display algorithms

AU - Lierop, van, M.L.P.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-71071-1_3

DO - 10.1007/978-3-642-71071-1_3

M3 - Conference contribution

SN - 978-3-642-71073-5

SP - 39

EP - 55

BT - Datastructures for raster graphics (Proceedings, Steensel, The Netherlands, June 24-28, 1985)

A2 - Kessener, L.R.A.

A2 - Peters, F.J.

A2 - Lierop, van, M.L.P.

PB - Springer

CY - Berlin

ER -

Intermediate data structures for display algorithms

Abstract

Access to Document

Fingerprint

Cite this