|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM174687559 |
003 |
DE-627 |
005 |
20231223140455.0 |
007 |
tu |
008 |
231223s2007 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0582.xml
|
035 |
|
|
|a (DE-627)NLM174687559
|
035 |
|
|
|a (NLM)17968107
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Yoon, Sung-Eui
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Random-accessible compressed triangle meshes
|
264 |
|
1 |
|c 2007
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Completed 14.12.2007
|
500 |
|
|
|a Date Revised 30.10.2007
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a 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
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Lindstrom, Peter
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 13(2007), 6 vom: 01. Nov., Seite 1536-43
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
773 |
1 |
8 |
|g volume:13
|g year:2007
|g number:6
|g day:01
|g month:11
|g pages:1536-43
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 13
|j 2007
|e 6
|b 01
|c 11
|h 1536-43
|