Full metadata record
DC FieldValueLanguage
dc.contributor.authorRevelles, J.
dc.contributor.authorUreña, C.
dc.contributor.authorLastra, M.
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-04-03T06:29:01Z
dc.date.available2015-04-03T06:29:01Z
dc.date.issued2000
dc.identifier.citationWSCG '2000: Conference proceeding: The 8th International Conference in Central Europe on Computers Graphics, Visualization and Interaktive Digital Media '2000 in cooperation with EUROGRAPHICS and IFIP WG 5.10: University of West Bohemia, Plzen, Czech republic, February 7 - 10, 2000, p. 212-219.en
dc.identifier.isbn80-7082-612-6
dc.identifier.urihttp://wscg.zcu.cz/wscg2000/Papers_2000/X31.pdf
dc.identifier.urihttp://hdl.handle.net/11025/15458
dc.description.abstractAn 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.format8 s.cs
dc.language.isoenen
dc.publisherUniversity of West Bohemiaen
dc.relation.ispartofseriesWSCG '2000: Conference proceedingen
dc.rights© University of West Bohemiaen
dc.subjectoctreecs
dc.subjectbinární stromcs
dc.subjectsledování paprskucs
dc.subjectakcelerační technikycs
dc.titleAn Efficient Parametric Algorithm for Octree Traversalen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.subject.translatedoctreeen
dc.subject.translatedbinary treeen
dc.subject.translatedray tracingen
dc.subject.translatedacceleration techniquesen
dc.type.statusPeer-revieweden
Appears in Collections:WSCG '2000: Conference proceeding

Files in This Item:
File Description SizeFormat 
Revelles.pdfPlný text327,19 kBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15458

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.