Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Laur

dblp:10/364 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › volume rendering
splatting
0.011991
Hierarchical splatting: a progressive refinement algorithm for volume rendering · SIGGRAPH 1991
Rendering
volume rendering
0.011991
Hierarchical splatting: a progressive refinement algorithm for volume rendering · SIGGRAPH 1991

Methods — techniques the papers use, named apart from their topics

octree fitting · 0.0hierarchical pyramid representation · 0.0gouraud shading · 0.0
YearPublicationVenuePosition
1991 Hierarchical splatting: a progressive refinement algorithm for volume rendering
abstract
This 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.
David Laur, Pat Hanrahan
SIGGRAPH1