Search
Now showing items 1-10 of 11
A Scalable Parallel Force-Directed Graph Layout Algorithm
(The Eurographics Association, 2008)
Understanding the structure, dynamics, and evolution of large graphs is becoming increasingly important in a variety of fields. The demand for visual tools to aid in this process is rising accordingly. Yet, many algorithms ...
A Study of Parallel Data Compression Using Proper Orthogonal Decomposition on the K Computer
(The Eurographics Association, 2014)
The growing power of supercomputers continues to improve scientists' ability to model larger, more sophisticated problems in science with higher accuracy. An equally important ability is to make full use of the data output ...
Scalable Parallel Feature Extraction and Tracking for Large Time-varying 3D Volume Data
(The Eurographics Association, 2013)
Large-scale time-varying volume data sets can take terabytes to petabytes of storage space to store and process. One promising approach is to process the data in parallel, and then extract and analyze only features of ...
Cross-Node Occlusion in Sort-Last Volume Rendering
(The Eurographics Association, 2010)
In the field of parallel volume rendering, occlusion is a concept which is already widely exploited in order to improve performance. However, when one moves to larger datasets the use of parallelism becomes a necessity, ...
Parallel Volume Rendering on the IBM Blue Gene/P
(The Eurographics Association, 2008)
Parallel volume rendering is implemented and tested on an IBM Blue Gene distributed-memory parallel architecture. The goal of studying the cost of parallel rendering on a new class of supercomputers such as the Blue Gene/P ...
In Situ Pathtube Visualization with Explorable Images
(The Eurographics Association, 2013)
In situ processing is considered to be the most plausible data analysis and visualization solution for extreme-scale simulations. Explorable images were introduced as an in situ visualization method to enable interactive ...
Finely-Threaded History-Based Topology Computation
(The Eurographics Association, 2014)
Graphics and visualization pipelines often make use of highly parallelized algorithms which transform an input mesh into an output mesh. One example is Marching Cubes, which transforms a voxel grid into a triangle mesh ...
A Scalable, Hybrid Scheme for Volume Rendering Massive Data Sets
(The Eurographics Association, 2006)
We introduce a parallel, distributed memory algorithm for volume rendering massive data sets. The algorithm's scalability has been demonstrated up to 400 processors, rendering one hundred million unstructured elements in ...
A Preview and Exploratory Technique for Large-Scale Scientific Simulations
(The Eurographics Association, 2011)
Successful in-situ and remote visualization solutions must have minimal storage requirements and account for only a small percentage of supercomputing time. One solution that meets these requirements is to store a compact ...
I/O Strategies for Parallel Rendering of Large Time-Varying Volume Data
(The Eurographics Association, 2004)
This paper presents I/O solutions for the visualization of time-varying volume data in a parallel and distributed computing environment. Depending on the number of rendering processors used, our I/O strategies help signifi- ...