![]() |
CiteULike | ![]() |
jnu_bapi's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Hierarchical splatting: a progressive refinement algorithm for volume renderingby: David Laur, Pat Hanrahan
In SIGGRAPH '91: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991), pp. 285-288.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis paper presents a progressive refinement algorithm for volume rendering which uses a pyramidal volume representation. Besides storing average values, the pyramid stores estimated error, so an octtree can be fit to the pyramid given a user-supplied precision. This octtree is then drawn using a set of splats, or footprints, each scaled to match the size of the projection of a cell. The splats themselves are approximated with RGBA Gouraud-shaded polygons, so that they can be drawn efficiently on modern graphics workstations. The result is a real-time rendering algorithm suitable for interactive applications.
BibTeX record
RIS record