Technical strategies for massive model visualization
Authors:
Open Access
- 2 June 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 405-415
Abstract
Interactive visualization of massive models still remains a challenging problem. This is mainly due to a combination of ever increasing model complexity with the current hardware design trend that leads to a widening gap between slow data access speed and fast data processing speed. We argue that developing efficient data access and data management techniques is key in solving the problem of interactive visualization of massive models. Particularly, we discuss visibility culling, simplification, cache-coherent layouts, and data compression techniques as efficient data management techniques that enable interactive visualization of massive models.405-41Keywords
Funding Information
- MIC (Development of Elemental Technology for Promoting Digital Textbook and u-Learning)
- Ministero dell'Istruzione, dell'Università e della Ricerca (CYBERSARKAIST)
This publication has 67 references indexed in Scilit:
- Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic ScenesComputer Graphics Forum, 2007
- Cache‐Efficient Layouts of Bounding Volume HierarchiesComputer Graphics Forum, 2006
- Real-time GPU rendering of piecewise algebraic surfacesACM Transactions on Graphics, 2006
- Guided visibility samplingACM Transactions on Graphics, 2006
- Adaptive tetrapuzzlesACM Transactions on Graphics, 2004
- Ray space factorization for from-region visibilityACM Transactions on Graphics, 2003
- Simplifying complex environments using incremental textured depth meshesACM Transactions on Graphics, 2003
- LOD visibility culling and occluder synthesisComputer-Aided Design, 2000
- A case for intelligent RAMIEEE Micro, 1997
- Heuristics for ray tracing using space subdivisionThe Visual Computer, 1990