Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main memory to graphics memory. Therefore, sev...
详细信息
ISBN:
(纸本)9781424408085
Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main memory to graphics memory. Therefore, several approaches to volume rendering from compact representations of volumetric data have been published that avoid most of the data transfer between main memory and the graphics programming unit (GPU) at the cost of additional data decompression by the GPIJ. To reduce this performance cost, adaptive sampling techniques were proposed;which are, however, usually restricted to the sampling in view direction. In this work, we present a GPU-based volume rendering algorithm with adaptive sampling in all three spatial directions;i.e., not only in view direction but also in the two perpendicular directions of the image plane. This approach allows us to reduce the number of samples dramatically without compromising image quality;thus, it is particularly well suited for many compressed representations of volumetric data that require a computational expensive GPU-based sampling of data.
A challenge in data analysis and visualization is to build new-generation software tools and systems to truly accelerate scientific discoveries. The recent focus of Princeton's next-generation software project is ...
详细信息
This paper introduces Temporal Density parallel Coordinates (TDPC) and Depth Cue parallel Coordinates (DCPC) which extend the standard 2D parallel coordinates technique to capture time-varying dynamics. The proposed t...
详细信息
Cluster-based tiled display walls can provide cost-effective and scalable displays with high resolution and a large display area. The software to drive them needs to scale too if arbitrarily large displays are to be b...
详细信息
Cluster-based tiled display walls can provide cost-effective and scalable displays with high resolution and a large display area. The software to drive them needs to scale too if arbitrarily large displays are to be built. Chromium is a popular software API used to construct such displays. Chromium transparently renders any OpenGL application to a tiled display by partitioning and sending individual OpenGL primitives to each client per frame. visualization applications often deal with massive geometric data with millions of primitives. Transmitting them every frame results in huge network requirements that adversely affect the scalability of the system. In this paper, we present Garuda, a client-server-based display wall framework that uses off-the-shelf hardware and a standard network. Garuda is scalable to large tile configurations and massive environments. It can transparently render any application built using the Open Scene Graph (OSG) API to a tiled display without any modification by the user. The Garuda server uses an object-based scene structure represented using a scene graph. The server determines the objects visible to each display tile using a novel adaptive algorithm that culls the scene graph to a hierarchy of frustums. Required parts of the scene graph are transmitted to the clients, which cache them to exploit the interframe redundancy. A multicast-based protocol is used to transmit the geometry to exploit the spatial redundancy present in tiled display systems. A geometry push philosophy from the server helps keep the clients in sync with one another. Neither the server nor a client needs to render the entire scene, making the system suitable for interactive rendering of massive models. Transparent rendering is achieved by intercepting the cull, draw, and swap functions of OSG and replacing them with our own. We demonstrate the performance and scalability of the Garuda system for different configurations of display wall. We also show that the serve
The proceedings contain 35 papers. The topics discussed include: multiscale visualization of dynamic software logs;relevance driven visualization of financial performance measures;model-free surface visualization of v...
ISBN:
(纸本)9783905673456
The proceedings contain 35 papers. The topics discussed include: multiscale visualization of dynamic software logs;relevance driven visualization of financial performance measures;model-free surface visualization of vascular trees;multi-resolution techniques for visual exploration of large time-series data;depth cues and density in temporal parallel coordinates;keystrokes: personalizing typed text with visualization;visualization of uncertainty in lattices to support decision-making;manual clustering refinement using interaction with blobs;grouse: feature-based, steerable graph hierarchy exploration;online dynamic graph drawing;and path visualization for adjacency matrices.
To use heterogeneous and geographically distributed resources as a platform for parallelvisualization is an intriguing topic of research. This is because of the immense potential impact of the work, and also because ...
详细信息
In this paper we present GPU-based techniques for the interactive visualization of large unsteady 3D flow fields on uniform grids. We propose a novel dual-core approach to asynchronously stream such fields from the CP...
详细信息
The proceedings contain 13 papers. The topics discussed include: sampling point-set implicits;low-discrepancy point sampling of meshes for rendering;direct computing of surface curvatures for point-set surfaces;intera...
ISBN:
(纸本)9783905673517
The proceedings contain 13 papers. The topics discussed include: sampling point-set implicits;low-discrepancy point sampling of meshes for rendering;direct computing of surface curvatures for point-set surfaces;interactive editing of large point clouds;SIMOD: making freeform deformation size-insensitive;efficient bounds for point-based animations;efficient refinement of dynamic point data;approximate star-shaped decomposition of point set data;on the use of Gromov-Hausdorff distances for shape comparison;topological methods for the analysis of high dimensional data sets and 3D object recognition;efficient point-based rendering using image reconstruction;surfel-based billboard hierarchies for fast rendering of 3D-objects;a parallelly decodeable compression scheme for efficient point-cloud rendering;and self-similarity-based compression of point clouds, with application to ray tracing.
Cluster analysis (CA) is a powerful strategy for the exploration of high-dimensional data in the absence of a-priori hypotheses or data classification models, and the results of CA can then be used to form such models...
详细信息
The proceedings contain 24 papers. The topics discussed include: estimating performance of a ray-tracing ASIC design;ray tracing on the CELL processor;improving ray tracing precision by object space intersection compu...
详细信息
ISBN:
(纸本)1424406935
The proceedings contain 24 papers. The topics discussed include: estimating performance of a ray-tracing ASIC design;ray tracing on the CELL processor;improving ray tracing precision by object space intersection computation;optimizing ray-triangle intersection via automated search;an evaluation of parallel grid construction for ray tracing dynamic scenes;omnidirectional ray tracing traversal algorithm for kd-trees;on the fast construction of spatial hierarchies for ray tracing;fast kd-tree construction with an adaptive error-bound heuristic;GPU-assisted ray casting of large scenes;interactive isosurface ray tracing of large octree volumes;global importance sampling of glossy surfaces using the photon map;incremental raycasting of piecewise quadratic surfaces on the GPU;terrain guided multi-level instancing of highly complex plant populations;and applying ray tracing for virtual reality and industrial design.
暂无评论