Partitioning and ordering large radiosity computations
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Optimal isosurface extraction from irregular volume data
Proceedings of the 1996 symposium on Volume visualization
Rendering complex scenes with memory-coherent ray tracing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Application-controlled demand paging for out-of-core visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Applied operating system concepts
Applied operating system concepts
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Surfels: surface elements as rendering primitives
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Out-of-core rendering of massive geometric environments
Proceedings of the conference on Visualization '02
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
Accelerated Isosurface Extraction in Time-Varying Fields
IEEE Transactions on Visualization and Computer Graphics
Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization
IEEE Transactions on Visualization and Computer Graphics
Out-Of-Core Rendering of Large, Unstructured Grids
IEEE Computer Graphics and Applications
Marching through the Visible Man
VIS '95 Proceedings of the 6th conference on Visualization '95
Visualizing Large-Scale Telecommunication Networks and Services
VISUALIZATION '99 Proceedings of the 10th IEEE Visualization 1999 Conference (VIS '99)
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Combining point clouds and volume objects in volume scene graphs
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Efficient reduction of access latency through object correlations in virtual environments
EURASIP Journal on Applied Signal Processing
Dynamic Chunking for Out-of-Core Volume Visualization Applications
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Intelligent-based latency reduction in 3D walkthrough
ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
Hi-index | 0.00 |
Data management is the very first issue in handling very large datasets. Many existing out-of-core algorithms used in visualization are closely coupled with application-specific logic. This paper presents two knowledgebased out-of-core prefetching algorithms that do not use hard-coded rendering-related logic. They acquire the knowledge of the access history and patterns dynamically, and adapt their prefetching strategies accordingly. We have compared the algorithms with a demand-based algorithm, as well as a more domain-specific out-of-core algorithm. We carried out our evaluation in conjunction with an example application where rendering multiple point sets in a volume scene graph put a great strain on the rendering algorithm in terms of memory management. Our results have shown that the knowledge-based approach offers a better cache-hit to disk-access trade-off. This work demonstrates that it is possible to build an out-of-core prefetching algorithm without depending on rendering-related application-specific logic. The knowledge based approach has the advantage of being generic, efficient, flexible and self-adaptive.