Title: Memory-Efficient Sliding Window Progressive Meshes
Authors: Turchyn, Pavlo
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.
Issue Date: 2007
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2007/Papers_2007/full/!WSCG2007_Full_Proceedings_Final-1.zip
ISBN: 978-80-86943-98-5
Keywords: míra detailu;grafická procesory;progresivní mřížky;nezávislé sety
Keywords in different language: level of detail;graphic processing units;progressive meshes;independent sets
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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2007: Full Papers Proceedings

Files in This Item:
File Description SizeFormat 
Turchyn.pdfPlný text751,01 kBAdobe PDFView/Open
Turchyn_prezentace.ppsPrezentace733 kBUnknownView/Open
Turchyn_video.zipVideo1,3 MBZIPView/Open

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

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