Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorHrúz, T.
dc.contributor.authorPovažan, I.
dc.contributor.authorGosiorovský, R.
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-25T12:13:14Z
dc.date.available2015-09-25T12:13:14Z
dc.date.issued1996
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.identifier.urihttp://wscg.zcu.cz/wscg1996/wscg96.htm#abs
dc.identifier.urihttp://hdl.handle.net/11025/15985
dc.format11 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
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.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
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
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 4, number 1-2 (1996)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Hruz_96.pdfPlný text1,97 MBAdobe PDFZobrazit/otevřít
Zobrazit minimální záznam Zobrazit statistiky


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/15985

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

hledání
navigace
  1. DSpace at University of West Bohemia
  2. Publikace ZČU / UWB Publications
  3. Časopisy ZČU / UWB Journals
  4. Journal of WSCG
  5. Volume 4 (1996)
  6. Volume 4, number 1-2 (1996)