Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorRevelles, J.
dc.contributor.authorUrena, C.
dc.contributor.authorLastra, M.
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-22T06:11:32Z
dc.date.available2015-09-22T06:11:32Z
dc.date.issued2000
dc.identifier.citationJournal of WSCG. 2000, vol. 8, no. 1-3.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://hdl.handle.net/11025/15821
dc.identifier.urihttp://wscg.zcu.cz/wscg2000/wscg_2000_program.htm
dc.format8 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.subjectOctreecs
dc.subjectbinární stromcs
dc.subjectsledování paprskucs
dc.subjectakcelerační technikycs
dc.titleAn efficient parametric algorithm for octree traversalen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedAn octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed-up and visualisation of hierarchical density models by ray-casting. Several methods have been proposed to achieve this goal, which differ in the order in which intersected voxels are visited. In this paper we introduce a new top-down parametric method. The main difference with previously proposed methods is related to descent movements, that is, the selection of a child sub-voxel from the current one. This selection, as the algorithm, is based on the parameter of the ray and comprises simple comparisons. The resulting algorithm is easy to implement, and efficient when compared to other related top-down and bottom-up algorithms for octrees. Finally, a comparison with Kelvin’s method for binary trees is presented.en
dc.subject.translatedOctreeen
dc.subject.translatedbinary treeen
dc.subject.translatedray tracingen
dc.subject.translatedacceleration techniquesen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 8, number 1-3 (2000)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
X31.pdfPlný text327,19 kBAdobe 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/15821

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 8 (2000)
  6. Volume 8, number 1-3 (2000)