Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Turchyn, Pavlo | |
dc.contributor.editor | Rossignac, Jarek | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2014-04-10T09:00:01Z | |
dc.date.available | 2014-04-10T09:00:01Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | WSCG '2007: Full Papers Proceedings: The 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2007 in co-operation with EUROGRAPHICS: University of West Bohemia Plzen Czech Republic, January 29 – February 1, 2007, p. 33-40. | en |
dc.identifier.isbn | 978-80-86943-98-5 | |
dc.identifier.uri | http://wscg.zcu.cz/wscg2007/Papers_2007/full/!WSCG2007_Full_Proceedings_Final-1.zip | |
dc.identifier.uri | http://hdl.handle.net/11025/11003 | |
dc.description.abstract | Progressive mesh is a data structure that encodes a continuous spectrum of mesh approximations. Sliding window progressive meshes (SWPM) minimize data transfers between CPU and GPU by storing mesh data in static on-GPU memory buffers [For01]. The main disadvantages of the original SWPM algorithm are poor vertex cache usage efficiency, and big resulting datasets. Connectivity-based algorithm [KT04] achieves a good vertex cache coherence but it does not address the problem of high memory utilization. In this paper, we describe estimates for the size of memory buffers, and describe methods to reduce the index datasets. We achieve 20% reduction due to the use hierarchical data structures (clustered patches); further reduction (50% or more) is possible if one can optimize connectivity of input meshes, or is willing to decrease the number of mesh approximations stored in the progressive mesh. | en |
dc.format | 8 s., 1 prezentace, 1 video | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Václav Skala - UNION Agency | cs |
dc.relation.ispartofseries | WSCG '2007: Full Papers Proceedings | en |
dc.rights | © Václav Skala - UNION Agency | en |
dc.subject | míra detailu | cs |
dc.subject | grafická procesory | cs |
dc.subject | progresivní mřížky | cs |
dc.subject | nezávislé sety | cs |
dc.title | Memory-Efficient Sliding Window Progressive Meshes | en |
dc.type | konferenční příspěvek | cs |
dc.type | conferenceObject | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.subject.translated | level of detail | en |
dc.subject.translated | graphic processing units | en |
dc.subject.translated | progressive meshes | en |
dc.subject.translated | independent sets | en |
dc.type.status | Peer-reviewed | en |
dc.type.driver | info:eu-repo/semantics/conferenceObject | en |
dc.type.driver | info:eu-repo/semantics/publishedVersion | en |
Vyskytuje se v kolekcích: | WSCG '2007: Full Papers Proceedings |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Turchyn.pdf | Plný text | 751,01 kB | Adobe PDF | Zobrazit/otevřít |
Turchyn_prezentace.pps | Prezentace | 733 kB | Unknown | Zobrazit/otevřít |
Turchyn_video.zip | Video | 1,3 MB | ZIP | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11003
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.