Full metadata record
DC FieldValueLanguage
dc.contributor.authorHrúz, T.
dc.contributor.authorPovažan, I.
dc.contributor.authorGosiorovský, R.
dc.contributor.editorSkala, Václav
dc.identifier.citationJournal of WSCG. 1996, vol. 4, no. 1-2, p. 246-256.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.format11 s.cs
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectpočítačová grafikacs
dc.subjectdatová strukturacs
dc.subjectskryté čárycs
dc.titleHidden line problem formulated as a set union problemen
dc.description.abstract-translatedThis 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.en
dc.subject.translatedcomputer graphicsen
dc.subject.translateddata structureen
dc.subject.translatedhidden linesen
Appears in Collections:Volume 4, number 1-2 (1996)

Files in This Item:
File Description SizeFormat 
Hruz_96.pdfPlný text1,97 MBAdobe PDFView/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.