Název:	Hidden line problem formulated as a set union problem
Autoři:	Hrúz, T. Považan, I. Gosiorovský, R.
Citace zdrojového dokumentu:	Journal of WSCG. 1996, vol. 4, no. 1-2, p. 246-256.
Datum vydání:	1996
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://wscg.zcu.cz/wscg1996/wscg96.htm#abs http://hdl.handle.net/11025/15985
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	počítačová grafika;datová struktura;skryté čáry
Klíčová slova v dalším jazyce:	computer graphics;data structure;hidden lines
Abstrakt v dalším jazyce:	This paper describes an alternative approach to the hidden line problem in computer graphics. It is assumed that a 3D visible scene consisting of conver planar polygons with known visibility order is given. An abstract data structure together with a set of operation UNION is then implemented on the segment tree data structure. The solution of the visibility problem relies mainly on a two-way scan conversion process and the hidden line problem is formulated as a set union problem. The worst case complexity of the presented algorithm is O(sn log s) where n is the number of polygons and s is a resolution. The algorithm is output sensitive in the image space sense. In certain situations priority order is given or easily computable and resolution of raster space is very high. In these situastions the algorithm presented can be faster than Z-buffer.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 4, number 1-2 (1996)

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.