Full metadata record
DC FieldValueLanguage
dc.contributor.authorSzirmay-Kalos, László
dc.contributor.authorMárton, Gábor
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-30T06:14:35Z
dc.date.available2015-09-30T06:14:35Z
dc.date.issued1995
dc.identifier.citationJournal of WSCG. 1995, vol. 3, no. 1-2, p. 313-322.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/16052
dc.format10 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.subjectradiozitacs
dc.subjectvyhodnocení složitostics
dc.subjectrandomizované algoritmycs
dc.titleOn convergence and complexity of radiosity algorithmsen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedThis paper evaluates and compares the convergence and complexity characteristics of radiosity algorithms with a special emphasis on randomized methods.en
dc.subject.translatedradiosityen
dc.subject.translatedcomplexity evaluationen
dc.subject.translatedrandomized algorithmsen
dc.type.statusPeer-revieweden
Appears in Collections:Volume 3, number 1-2 (1995)

Files in This Item:
File Description SizeFormat 
Szirmay_95.pdfPlný text1,28 MBAdobe PDFView/Open
Show simple item record


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

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

search
navigation
  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 3 (1995)
  6. Volume 3, number 1-2 (1995)