dc.contributor.author | Biedert, Tim | en_US |
dc.contributor.author | Garth, Christoph | en_US |
dc.contributor.editor | C. Dachsbacher and P. Navrátil | en_US |
dc.date.accessioned | 2015-05-24T19:41:17Z | |
dc.date.available | 2015-05-24T19:41:17Z | |
dc.date.issued | 2015 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/pgv.20151158 | en_US |
dc.description.abstract | High-fidelity simulation models on large-scale parallel computer systems can produce data at high computational throughput, but modern architectural trade-offs make full persistent storage to the slow I/O subsystem prohibitively costly with respect to time. We demonstrate the feasibility and potential of combining in situ topological contour tree analysis and compact image-based data representation to address this problem. Our experiments show significant reductions in storage requirements using topology-guided layered depth imaging, while preserving flexibility for explorative visualization and analysis. Our approach represents an effective and easy-to-control trade-off between storage overhead and visualization fidelity for large data visualization. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | I.3.6 [Computer Graphics] | en_US |
dc.subject | Methodology and Techniques | en_US |
dc.subject | Graphics data structures and data types | en_US |
dc.title | Contour Tree Depth Images For Large Data Visualization | en_US |
dc.description.seriesinformation | Eurographics Symposium on Parallel Graphics and Visualization | en_US |
dc.description.sectionheaders | Improved Algorithms | en_US |
dc.identifier.doi | 10.2312/pgv.20151158 | en_US |
dc.identifier.pages | 77-86 | en_US |