Results 1 - 10
of
23
A survey of the marching cubes algorithm
, 2006
"... A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163–9], a well-known cell-by-cell method for extraction of isosurfaces from scalar volumetric data sets, is presented ..."
Abstract
-
Cited by 45 (0 self)
- Add to MetaCart
A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163–9], a well-known cell-by-cell method for extraction of isosurfaces from scalar volumetric data sets, is presented. The paper’s primary aim is to survey the development of the algorithm and its computational properties, extensions, and limitations (including the attempts to resolve its limitations). A rich body of publications related to this aim are included. Representative applications and spin-off work are also considered and related techniques are briefly discussed.
Scalable Interactive Volume Rendering Using Off-the-Shelf Components
- In Proc. IEEE Symp. Parallel Large-Data Vis. Graphics (PVG) (2001
, 2001
"... This paper describes an application of a second generation implementation of the Sepia architecture (Sepia-2) to interactive volumetric visualization of large rectilinear scalar fields. By employing pipelined associative blending operators in a sort-last configuration a demonstration system with 8 r ..."
Abstract
-
Cited by 31 (0 self)
- Add to MetaCart
(Show Context)
This paper describes an application of a second generation implementation of the Sepia architecture (Sepia-2) to interactive volumetric visualization of large rectilinear scalar fields. By employing pipelined associative blending operators in a sort-last configuration a demonstration system with 8 rendering computers sustains 24 to 28 frames per second while interactively rendering large data volumes (1024x256x256 voxels, and 512x512x512 voxels). We believe interactive performance at these frame rates and data sizes is unprecedented. We also believe these results can be extended to other types of structured and unstructured grids and a variety of GL rendering techniques including surface rendering and shadow mapping. We show how to extend our single-stage crossbar demonstration system to multi-stage networks in order to support much larger data sizes and higher image resolutions. This requires solving a dynamic mapping problem for a class of blending operators that includes Porter-Duff compositing operators. CR Categories: C.2.4 [Computer Systems Organization]: Computer-Communication Networks---Distributed Systems; C.2.5 [Computer Systems Organization]: Computer-Communication Networks---Local and Wide Area Networks; C.5.1 [Computer System Implementation]: Large and Medium ("Mainframe") Computers---Super Computers; D.1.3 [Software]: Programming Techniques---Concurrent Programming; I.3.1 [Computing Methodologies ]: Computer Graphics---Hardware Architecture; I.3.2 [Computing Methodologies]: Computer Graphics---Graphics Systems; I.3.3 [Computing Methodologies]: Computer Graphics--- Picture/Image Generation; I.3.7 [Computing Methodologies]: Computer Graphics---Three-Dimensional Graphics and Realism Keywords: sort-last, parallel, cluster, shear-warp, volume rendering, ray-c...
Cots cluster-based sort-last rendering: Performance evaluation and pipelined implementation
- In Proceedings of IEEE Visualization
, 2005
"... Figure 1: Views of the head section (512x512x209) of the visible female CT data with 16 nodes (a space has been left between the subvolumes to highlight their boundaries). Using a 3 years old 32-node COTS cluster, a volume dataset can be rendered at constant 13 frames per second on a 1024 × 768 rend ..."
Abstract
-
Cited by 31 (3 self)
- Add to MetaCart
(Show Context)
Figure 1: Views of the head section (512x512x209) of the visible female CT data with 16 nodes (a space has been left between the subvolumes to highlight their boundaries). Using a 3 years old 32-node COTS cluster, a volume dataset can be rendered at constant 13 frames per second on a 1024 × 768 rendering area using 5 nodes. On a 1.5 years old, fully optimized, 5-node COTS cluster, the frame rate obtained for the same rendering area reaches constant 31 frames per second. We truly expect our future work, including further algorithm optimizations and hardware tuning on a modern PC cluster, to provide higher frame rates for bigger datasets (using more nodes) on larger rendering areas. Sort-last parallel rendering is an efficient technique to visualize huge datasets on COTS clusters. The dataset is subdivided and distributed across the cluster nodes. For every frame, each node renders a full resolution image of its data using its local GPU, and the images are composited together using a parallel image compositing algorithm. In this paper, we present a performance evaluation of standard sort-last parallel rendering methods and of the different improvements proposed in the literature. This evaluation is based on a detailed analysis of the different hardware and software components.
Feature Based Volumetric Video Compression for Interactive Playback
, 2002
"... In this paper, we describe a compression scheme for encoding time-varying isosurfaces and amorphous volumetric features (volumes within specified value ranges) in a unified way, which allows for on-line reconstruction and rendering. Since the size of even one frame in a time-varying data set is very ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
In this paper, we describe a compression scheme for encoding time-varying isosurfaces and amorphous volumetric features (volumes within specified value ranges) in a unified way, which allows for on-line reconstruction and rendering. Since the size of even one frame in a time-varying data set is very large, transmission and online reconstruction are the main bottlenecks for interactive visualization of time-varying volume and surface data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and encode only the significant blocks that contribute to the isosurface and volumetric features. The result shows that our compression scheme achieves high compression ratio with fast reconstruction, which is effective for client-side rendering of time-varying isosurfaces with amorphous volumetric features.
Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution
- PROCEEDINGS OF THE JOINT EUROGRAPHICS-IEEE TCVG SYMPOSIUM ON VISUALIZATION (VISSYM-02
, 2002
"... In this paper we describe a parallel and out-of-core view-dependent isocontour visualization algorithm that efficiently extracts and renders the visible portions of an isosurface from large datasets. The algorithm first creates an occlusion map using ray-casting and nearest neighbors. With the occ ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
In this paper we describe a parallel and out-of-core view-dependent isocontour visualization algorithm that efficiently extracts and renders the visible portions of an isosurface from large datasets. The algorithm first creates an occlusion map using ray-casting and nearest neighbors. With the occlusion map constructed, the visible portion of the isosurface is extracted and rendered. All steps are in a single pass with minimal communication overhead. The
Encoding Volumetric Grids For Streaming Isosurface Extraction
- in 3DPVT, 2003
, 2004
"... Gridded volumetric data sets representing simulation or tomography output are commonly visualized by displaying a triangulated isosurface for a particular isovalue. When the grid is stored in a standard format, the entire volume must be loaded from disk, even though only a fraction of the grid cells ..."
Abstract
-
Cited by 17 (3 self)
- Add to MetaCart
(Show Context)
Gridded volumetric data sets representing simulation or tomography output are commonly visualized by displaying a triangulated isosurface for a particular isovalue. When the grid is stored in a standard format, the entire volume must be loaded from disk, even though only a fraction of the grid cells may intersect the isosurface.
SOLTESZ S.: Remote visualization by browsing image based databases with logistical networking
- In ProceedingsofSupercomputing
, 2003
"... The need to provide remote visualization of large datasets with adequate levels of quality and interactivity has become a major impediment to distributed collaboration in Computational Science. Although Image Based Rendering (IBR) techniques based on plenoptic functions have some important advantage ..."
Abstract
-
Cited by 16 (9 self)
- Add to MetaCart
(Show Context)
The need to provide remote visualization of large datasets with adequate levels of quality and interactivity has become a major impediment to distributed collaboration in Computational Science. Although Image Based Rendering (IBR) techniques based on plenoptic functions have some important advantages over other approaches to this problem, they suffer from an inability to deal with issues of network latency and server load, due to the large size of the IBR databases they generate. Consequently, IBR techniques have been left largely unexplored for this purpose. In this paper we describe strategies for addressing these obstacles using Logistical Networking (LoN), which is a new and highly scalable approach to deploying storage as a shared communication resource. Leveraging LoN technology and infrastructure, we developed a remote visualization system based on concepts of light field rendering, an IBR method using a 4-D plenoptic function. Our system extends existing work on light fields by employing a modified method of parameterization and data organization that supports more efficient prefetching, caching and loss-less compression. Using this approach, we have been able to interactively browse multi-gigabyte, high-resolution light field databases across the wide area network at 30 frames per second. 1.
Compression of isosurfaces for structured volumes. VMV
, 2001
"... In many applications surfaces containing a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by polygonal isosurfaces generated from gridded volume data. However, most current state-of-the-art geometry compress ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
(Show Context)
In many applications surfaces containing a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by polygonal isosurfaces generated from gridded volume data. However, most current state-of-the-art geometry compression systems do not capitalize on the structure that is characteristic of such isosurfaces, namely that the surfaces are defined by a set of vertices on edges of the grid. We propose a compression method for isosurfaces that is designed to exploit this feature. We tested our method for several isosurfaces from a CT scan of a human head. For this data set our coder outperformed state-of-the-art geometry compression methods by a factor of 2.2 to 2.8 in terms of compression ratio. 1
Blic: bi-level isosurface compression
- in VIS ’02: Proceedings of the conference on Visualization ’02
, 2002
"... ..."
(Show Context)
