A survey of algorithms for volume visualization
- 1 August 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 26 (3) , 194-201
- https://doi.org/10.1145/142413.142427
Abstract
Many computer graphics programmers are working in the area of scientific visualization. One of the most interesting and fast-growing areas in scientific visualization is volume visualization. Volume visualization systems are used to create high-quality images from scalar and vector datasets defined on multidimensional grids, usually for the purpose of gaining insight into a scientific problem. Most volume visualization techniques are based on one of about five foundation algorithms. These algorithms, and the background necessary to understand them, are described here. Pointers to more detailed descriptions, further reading, and advanced techniques are also given.Keywords
This publication has 27 references indexed in Scilit:
- The distributed laboratoryCommunications of the ACM, 1992
- Hierarchical splattingACM SIGGRAPH Computer Graphics, 1991
- A triangulation algorithm from arbitrary shaped multiple planar contoursACM Transactions on Graphics, 1991
- Volume probes: interactive data exploration on arbitrary gridsACM SIGGRAPH Computer Graphics, 1990
- A polygonal approximation to direct scalar volume renderingACM SIGGRAPH Computer Graphics, 1990
- Footprint evaluation for volume renderingACM SIGGRAPH Computer Graphics, 1990
- Volume visualizationThe Visual Computer, 1990
- Volume renderingCommunications of the ACM, 1989
- V-bufferACM SIGGRAPH Computer Graphics, 1988
- Data structure forsoft objectsThe Visual Computer, 1986