Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorŠrámek, Miloš
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-30T12:14:46Z
dc.date.available2015-09-30T12:14:46Z
dc.date.issued1994
dc.identifier.citationJournal of WSCG. 1994, vol. 2, no. 1-2, p. 207-220.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://wscg.zcu.cz/wscg1994/wscg94.htm
dc.identifier.urihttp://hdl.handle.net/11025/16080
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.subjectskenování 3D datcs
dc.subject3D rekonstrukce datcs
dc.subjectvizualizacecs
dc.subjectalgoritmuscs
dc.titleAn algorithm for fast voxel scene traversalen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedTogether with improvement of tomographic methods of scanning 3D data, residing in an increase of distinguishing ability of the scanners, the quality of final 3D reconstruction of the data comes into foreground. An inevitable condition for visualization of small details, comparable with the voxel size is application of such algorithms, which enables to define a surface of the scanned object on subvoxel level. Coming out from paper published at previous year of Winter School on Computer Graphics and CAD Systems we present an algorithm for fast traversal of the voxel scene, which enables to find a nearest intersection of a ray with the object surface defined in such a way. High speed of the algorithm utilizes object coherency of the scene, which means that voxels belonging to the object are usually grouped in connected regions. The algorithm consist from two steps: preprocessing and scene traversal. In the preprocessing phase we assign to each background voxel of the segmented scene a value equal to its chessboard distance from the nearest object voxel, which defines a basic macro region with no object voxel inside. While generating a discrete ray, we can jump over this region, which results in up to 6-fold speed up of the traversal. The algorithm has no additional demands on memory, since the distance is stored in originally "empty" background voxels.en
dc.subject.translatedscanning 3D dataen
dc.subject.translated3D reconstruction of the datasen
dc.subject.translatedvisualizationen
dc.subject.translatedalgorithmen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 2, number 1-2 (1994)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Sramek_94.pdfPlný text1,27 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/16080

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 2 (1994)
  6. Volume 2, number 1-2 (1994)