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

Philipp von Radziewsky

dblp:182/5889 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › monte carlo rendering
importance sampling
0.312017
Efficient Stochastic Rendering of Static and Animated Volumes Using Visibility Sweeps · IEEE Trans. Vis. Comput. Graph. 2017
Rendering
light transport
0.312017
Efficient Stochastic Rendering of Static and Animated Volumes Using Visibility Sweeps · IEEE Trans. Vis. Comput. Graph. 2017
Rendering › volume rendering
monte carlo volume rendering
0.312017
Efficient Stochastic Rendering of Static and Animated Volumes Using Visibility Sweeps · IEEE Trans. Vis. Comput. Graph. 2017
Rendering
volume rendering
0.312017
Efficient Stochastic Rendering of Static and Animated Volumes Using Visibility Sweeps · IEEE Trans. Vis. Comput. Graph. 2017

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

sweeping-plane algorithm · 0.3quadtree hierarchy · 0.3octahedral representation · 0.3importance sampling · 0.3
YearPublicationVenuePosition
2017 Efficient Stochastic Rendering of Static and Animated Volumes Using Visibility Sweeps
abstract
Stochastically solving the rendering integral (particularly visibility) is the de-facto standard for physically-based light transport but it is computationally expensive, especially when displaying heterogeneous volumetric data. In this work, we present efficient techniques to speed-up the rendering process via a novel visibility-estimation method in concert with an unbiased importance sampling (involving environmental lighting and visibility inside the volume), filtering, and update techniques for both static and animated scenes. Our major contributions include a progressive estimate of partial occlusions based on a fast sweeping-plane algorithm. These occlusions are stored in an octahedral representation, which can be conveniently transformed into a quadtree-based hierarchy suited for a joint importance sampling. Further, we propose sweep-space filtering, which suppresses the occurrence of fireflies and investigate different update schemes for animated scenes. Our technique is unbiased, requires little precomputation, is highly parallelizable, and is applicable to a various volume data sets, dynamic transfer functions, animated volumes and changing environmental lighting.
Philipp von Radziewsky, Thomas Kroes, Martin Eisemann, Elmar Eisemann
IEEE Trans. Vis. Comput. Graph.1
2016 Optimized subspaces for deformation-based modeling and shape interpolation
Philipp von Radziewsky, Elmar Eisemann, Hans-Peter Seidel, Klaus Hildebrandt
Comput. Graph.1