The Community for Technology Leaders
Green Image
Issue No. 06 - November/December (2007 vol. 13)
ISSN: 1077-2626
pp: 1536-1543
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2?6 times overall speedup compared to using uncompressed meshes.
Mesh compression, random access, cache-coherent layouts, mesh data structures, external memory algorithms
Peter Lindstrom, Sung-eui Yoon, "Random-Accessible Compressed Triangle Meshes", IEEE Transactions on Visualization & Computer Graphics, vol. 13, no. , pp. 1536-1543, November/December 2007, doi:10.1109/TVCG.2007.70585
90 ms
(Ver 3.3 (11022016))