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.
read more
Abstract: The application of volume-rendering techniques to the display of surfaces from sampled scalar functions of three spatial dimensions is discussed. It 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. Surface-shading calculations are performed at every voxel with local gradient vectors serving as surface normals. In a separate step, surface classification operators are applied to compute a partial opacity of every voxel. Operators that detect isovalue contour surfaces and region boundary surfaces are examined. The technique is simple and fast, yet displays surfaces exhibiting smooth silhouettes and few other aliasing artifacts. The use of selective blurring and supersampling to further improve image quality is described. Examples from molecular graphics and medical imaging are given. >
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
A scalable architecture for volume rendering
Günter Knittel
- 12 Sep 1994
TL;DR: The operational principles of a scalable hardware accelerator for volume rendering are described, which provides an atomic unit which already provides sophisticated volume graphics at interactive rendering speed and can then be achieved by operating multiple units in parallel.
Designing optimal parallel volume rendering algorithms
Craig M. Wittenbrink
- 02 Jan 1993
TL;DR: A methodology to control the complexity in designing parallel algorithms is introduced, and the result is parallel algorithms with all of the features of sequential ones that deliver the promise of parallelism.
14
Multiresolution and hierarchical methods for the visualization of volume data
TL;DR: Two different approaches and visualization algorithms based upon them are presented: wavelet analysis deriving a hierarchy of coarser representations from the original data set and multilevel finite elements generating successively refined tetrahedral grids from an initially coarse triangulation.
14
A Parallel Implementation of 2-D/3-D Image Registration for Computer-Assisted Surgery
Fumihiko Ino,Yasuhiro Kawasaki,Takahito Tashiro,Yoshikazu Nakajima,Yoshinobu Sato,Shinichi Tamura,Kenichi Hagihara +6 more
- 20 Jul 2005
TL;DR: This paper presents the design and implementation of a parallel two-dimensional/three-dimensional (2-D/3-D) image registration method for computer-assisted surgery, aiming at making computation time short enough to carry out registration tasks during surgery.
Iteration aware prefetching for remote data access
Philip J. Rhodes,S. Ramakrishnan +1 more
- 05 Dec 2005
TL;DR: It is shown that latency penalties can be dramatically reduced using explicit knowledge of a user's access pattern represented as an iterator, and planned additions to existing grid services to allow selection of datasets according to the user access pattern are described.
References
Marching cubes: A high resolution 3D surface construction algorithm
William E. Lorensen,Harvey E. Cline +1 more
- 01 Aug 1987
TL;DR: In this paper, a divide-and-conquer approach is used to generate inter-slice connectivity, and then a case table is created to define triangle topology using linear interpolation.
Illumination for computer generated pictures
TL;DR: Human visual perception and the fundamental laws of optics are considered in the development of a shading rule that provides better quality and increased realism in generated images.
Compositing digital images
Thomas K Porter,Thomas Douglas Selkirk Duff +1 more
- 01 Jan 1984
TL;DR: In this article, a matte component can be computed similarly to the color channels for four-channel pictures, and guidelines for the generation of elements and arithmetic for their arbitrary compositing are discussed.
1.4K
Compositing digital images
PorterThomas,DuffTom +1 more
TL;DR: Most computer graphics pictures have been computed all at once, so that the rendering program takes care of all computations relating to the overlap of objects.
645
Shading 3D-Images from CT Using Gray-Level Gradients
Karl Heinz Höhne,Ralph Bernstein +1 more
TL;DR: For the 3D-reconstruction of organ surfaces from tomograms, a shading method based on the partial volume effect is presented and it is shown, that at least for bone and soft tissue surfaces, the results are superior to conventional shading.
288
Related Papers (5)
[...]
Robert Drebin,Loren C. Carpenter,Pat Hanrahan +2 more
- 01 Jun 1988
William E. Lorensen,Harvey E. Cline +1 more
- 01 Aug 1987