Title: | Hidden line problem formulated as a set union problem |
Authors: | Hrúz, T. Považan, I. Gosiorovský, R. |
Citation: | Journal of WSCG. 1996, vol. 4, no. 1-2, p. 246-256. |
Issue Date: | 1996 |
Publisher: | Václav Skala - UNION Agency |
Document type: | č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) |
Keywords: | počítačová grafika;datová struktura;skryté čáry |
Keywords in different language: | computer graphics;data structure;hidden lines |
Abstract in different language: | 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. |
Rights: | © Václav Skala - UNION Agency |
Appears in Collections: | Volume 4, number 1-2 (1996) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Hruz_96.pdf | Plný text | 1,97 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/15985
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.