Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorStolte, Nilo
dc.contributor.authorCaubet, René
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-30T06:03:34Z
dc.date.available2015-09-30T06:03:34Z
dc.date.issued1995
dc.identifier.citationJournal of WSCG. 1995, vol. 3, no. 1-2, p. 300-312.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://wscg.zcu.cz/wscg1995/wscg95.htm
dc.identifier.urihttp://hdl.handle.net/11025/16050
dc.format13 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.subjectsledování paprskucs
dc.subjectOctreecs
dc.subject3D DDAcs
dc.titleDiscrete ray-tracing high resolution 3D gridsen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedThis article suggests a new approach to discrete Ray-Tracing in which a two step three-dimensional DDA and an octree are used. A verpy important problem regarding this kind of Ray Tracing, also known as Raster Ray Tracing, is the amount of memory required to store the 3D raster grid which will contain the discretized scene to be visualized. Since the resolution of this grid is huge because the voxel is assumed to be approximately the size of a pixel on the screen, it is limited by the maximum amount of memory of todays´ machines. Although using case in most scenes, an important memory saving is achieved. This memory saving helps using discrete Ray Tracing in normal workstations. It is shown that the special octree presented here doesn´t slow down Ray Tracing significantly and even competes with normal discrete Ray-Tracing. It is also shown that in critical cases this octree will not occupy much more space than a normal 3D grid. Another important problem is the bottleneck caused by the three-dimensional DDA in such huge resolution ones. The process can be divided in two steps where optimal times of three-dimensional DDA are achieved. This is shown through the comparative tests with the single step process.en
dc.subject.translatedray tracingen
dc.subject.translatedOctreeen
dc.subject.translated3D DDAen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 3, number 1-2 (1995)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Stolte_95.pdfPlný text3,04 MBAdobe PDFZobrazit/otevřít


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

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