Proceedings Article10.1145/258694.258730
A ray-slice-sweep volume rendering engine
Ingmar Bitter,Arie E. Kaufman +1 more
- 03 Aug 1997
- pp 121-130
TL;DR: This paper presents Cube-.#L, a volume rendering architecture which employs a ray-slice-sweeping algorithm which improves the Cube-4 architecture in three ways, and Cube-AL, which has less control overhead than Cube-C.
read more
Abstract: Ray-slice-sweeping is a plane sweep algorithm for volume rendering, The compositing buffer sweeps through the volume and combines the accumulated image with the new slice of just-projected voxels. The image combination is guided by sight rays from the view point through every voxel of the new slice. Cube-.#L is a volume rendering architecture which employs a ray-slice-sweeping algorithm. It improves the Cube-4 architecture in three ways. First, during perspective projection all voxels of the dataset contribute to the rendering. Second, it computes gradients at the voxel positions which improves accuracy and allows a more compact implementation, Third, Cube-AL has less control overhead than Cube-C
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Apparatus and method for real-time volume processing and universal 3d rendering
Arie E. Kaufman,Ingmar Bitter,Baoquan Chen,Frank Dachille,Kevin Kreeger +4 more
- 16 Jul 1999
TL;DR: In this article, a volumetric ray casting of a 3D volume is performed, where the volume is divided into a plurality of consecutive regions having exponentially increasing bounds, and then the entire volume has to be processed.
161
Ray casting architectures for volume visualization
TL;DR: A new metric is introduced that normalizes performance to compare several special-purpose architectures that seek to render volumes at interactive rates that have cost, performance and size advantages over parallel processors.
Vizard II, a PCI-card for real-time volume rendering
M. Meißner,U. Kanus,W. Straßner +2 more
- 01 Aug 1998
TL;DR: In this paper we present a second generation VIZARD system being capable of rendering 256 3 datasets at interactive frame-rates providing high image quality.
72
Lossless Compression of Volume Data.
James E. Fowler,Roni Yagel +1 more
- 01 Jan 1995
TL;DR: In this article, a combination of differential pulse-code modulation (DPCM) and Huffman coding is used to compress volume data files, achieving a compression ratio of around 50%.
66
Architectures for real-time volume rendering
TL;DR: An innovative parallel dataflow scheme that requires no global communication except at the pixel level is developed, which combines the benefits of very high memory bandwidth, modularity, and scalability, a result which has not been achieved before.
52
References
Light field rendering
Marc Levoy,Pat Hanrahan +1 more
- 01 Aug 1996
TL;DR: This paper describes a sampled representation for light fields that allows for both efficient creation and display of inward and outward looking views, and describes a compression system that is able to compress the light fields generated by more than a factor of 100:1 with very little loss of fidelity.
Display of surfaces from volume data
TL;DR: In this article, a volume-rendering technique for the display of surfaces from sampled scalar functions of 3D spatial dimensions is discussed, which is not necessary to fit geometric primitives to the sampled data; images are formed by directly shading each sample and projecting it onto the picture plane.
Volume rendering
Robert Drebin,Loren C. Carpenter,Pat Hanrahan +2 more
- 01 Jun 1988
TL;DR: A technique for rendering images of volumes containing mixtures of materials is presented, which allows both the interior of a material and the boundary between materials to be colored.
1.7K
Fast volume rendering using a shear-warp factorization of the viewing transformation
Philippe Lacroute,Marc Levoy +1 more
- 24 Jul 1994
TL;DR: A new object-order rendering algorithm based on the factorization of a shear-warp factorization for perspective viewing transformations is described that is significantly faster than published algorithms with minimal loss of image quality.
V-buffer: visible volume rendering
Craig Upson,Michael Keeler +1 more
- 01 Jun 1988
TL;DR: This paper presents rendering techniques that use volumes as the basic geometric primitives, and a new method for the visualization of three-dimensional data resulting from numerical simulations and observations of natural phenomena.
446
Related Papers (5)
Hanspeter Pfister,Arie E. Kaufman +1 more
- 01 Oct 1996
[...]
Robert Drebin,Loren C. Carpenter,Pat Hanrahan +2 more
- 01 Jun 1988