A generalization of the z-buffer algorithm

C.W.A.M. Overveld, van; H.M.M. Wetering, van de

A generalization of the z-buffer algorithm

C.W.A.M. Overveld, van
, H.M.M. Wetering, van de

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen image without the necessity of re-drawing the entire scene. It is based on the notion of equivalent classes of pixels, that is groups of pixels that are covered by the same set of polygons. A data structure for representing these equivalence classes in an efficient manner is discussed.

Original language	English
Pages (from-to)	219-234
Journal	CWI Quarterly
Volume	5
Issue number	3
Publication status	Published - 1992

Cite this

@article{a70ba08358424035afddaad2fbfe9cab,

title = "A generalization of the z-buffer algorithm",

abstract = "A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen image without the necessity of re-drawing the entire scene. It is based on the notion of equivalent classes of pixels, that is groups of pixels that are covered by the same set of polygons. A data structure for representing these equivalence classes in an efficient manner is discussed.",

author = "\{Overveld, van\}, C.W.A.M. and \{Wetering, van de\}, H.M.M.",

year = "1992",

language = "English",

volume = "5",

pages = "219--234",

journal = "CWI Quarterly",

issn = "0922-5366",

number = "3",

}

TY - JOUR

T1 - A generalization of the z-buffer algorithm

AU - Overveld, van, C.W.A.M.

AU - Wetering, van de, H.M.M.

PY - 1992

Y1 - 1992

N2 - A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen image without the necessity of re-drawing the entire scene. It is based on the notion of equivalent classes of pixels, that is groups of pixels that are covered by the same set of polygons. A data structure for representing these equivalence classes in an efficient manner is discussed.

AB - A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen image without the necessity of re-drawing the entire scene. It is based on the notion of equivalent classes of pixels, that is groups of pixels that are covered by the same set of polygons. A data structure for representing these equivalence classes in an efficient manner is discussed.

M3 - Article

SN - 0922-5366

VL - 5

SP - 219

EP - 234

JO - CWI Quarterly

JF - CWI Quarterly

IS - 3

ER -

A generalization of the z-buffer algorithm

Abstract

Fingerprint

Cite this