On average-case complexity of ray tracing algorithms

dc.contributor.authorMárton, Gábor
dc.contributor.authorSzirmay-Kalos, László
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-29T11:58:40Z
dc.date.available2015-09-29T11:58:40Z
dc.date.issued1995
dc.description.abstract-translatedA theoretical framework for analyzing average-case time and storage complexity of ray tracing acceleration techniques is introduced by means of homogeneous spatial Poisson point processes. Then, as a demonstrative example of its application, the expected query time of the widely known technique based on a regular spatial grid is analyzed. Finally, an interpretation of the results is presented within the context of probability theory.en
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationJournal of WSCG. 1995, vol. 3, no. 1-2, p. 187-196.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/16035
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.rights.accessopenAccessen
dc.subjectsledování paprskucs
dc.subjectakcelerační technikycs
dc.subjectprostorová mřížkacs
dc.subjectteorie pravděpodobnostics
dc.subject.translatedray tracingen
dc.subject.translatedacceleration techniquesen
dc.subject.translatedspatial griden
dc.subject.translatedprobability theoryen
dc.titleOn average-case complexity of ray tracing algorithmsen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
Marton_95.pdf
Size:
1.23 MB
Format:
Adobe Portable Document Format
Description:
Plný text
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: