Full metadata record
DC FieldValueLanguage
dc.contributor.authorNechvíle, Karel
dc.contributor.authorSochor, Jiří
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-29T06:38:00Z
dc.date.available2015-09-29T06:38:00Z
dc.date.issued1996
dc.identifier.citationJournal of WSCG. 1996, vol. 4, no. 1-2, p. 285-293.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://wscg.zcu.cz/wscg1996/wscg96.htm#abs
dc.identifier.urihttp://hdl.handle.net/11025/16002
dc.format9 S.
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.subjectalgoritmycs
dc.subjectBSPcs
dc.titleForm factor evaluation with regional BSP treesen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedForm factor evaluation is an expensive and time consuming operation for radiosity applications. Visibility algorithms have to deal with a huge number of patches, rapidly increasing during an adaptive subdivision. This paper presents one possible approach to visibility part of complex radiosity algorithm - dividing the scene to non-overlapping regions and creating hierarchichal BSP tree with many regional BSP trees. The regional BSP approach offers possibility to solve radiosity in acceptable time without special HW.en
dc.subject.translatedradiosityen
dc.subject.translatedalgorithmsen
dc.subject.translatedBSPen
dc.type.statusPeer-revieweden
Appears in Collections:Volume 4, number 1-2 (1996)

Files in This Item:
File Description SizeFormat 
Nechvile_96.pdfPlný text1,03 MBAdobe PDFView/Open


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

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