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

Killian Herveau

dblp:244/2955 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-0146-7820ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

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 · 87% Geometric modeling and processing · 13%

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

TopicWeightPapersLastEvidence papers
Rendering › ray tracing
acceleration structure
0.712023
Analysis of Acceleration Structure Parameters and Hybrid Autotuning for Ray Tracing · IEEE Trans. Vis. Comput. Graph. 2023
Rendering
ray tracing
0.712023
Analysis of Acceleration Structure Parameters and Hybrid Autotuning for Ray Tracing · IEEE Trans. Vis. Comput. Graph. 2023
Geometric modeling and processing › spatial data structures
k-d tree
0.212023
Analysis of Acceleration Structure Parameters and Hybrid Autotuning for Ray Tracing · IEEE Trans. Vis. Comput. Graph. 2023

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

model-based prediction · 0.7autotuning · 0.7
YearPublicationVenuePosition
2023 Analysis of Acceleration Structure Parameters and Hybrid Autotuning for Ray Tracing
abstract
Finding optimal parameters for acceleration structures for raytracing is key to improved performance. Previous research has shown that a speedup of over 10% of rendering time is possible. Some parameters are interdependent which complicates the process of finding an optimal configuration. It is hence interesting to find them efficiently. Autotuning is an automatic optimization scheme able to search for optimal configurations and has been applied successfully to kD-trees in the past, which we apply today on BVHs. The more parameters to optimize, the more difficult it is to find optimal solutions. In this article, we analyze in detail the behavior of the parameters and their impact on acceleration structure building and rendering time. We show the interdependence and context sensitivity (i.e., scene, viewpoint) of the parameters. Based on the use case, this allows to target only crucial parameters. Convergence speed towards an optimal configuration is essential. To find better parameters, the autotuner needs to build the acceleration structure over and over, changing parameters every time. We introduce a hybrid model-based prediction and online autotuning method to address this issue. The prediction model allows for both instantaneous near-optimal configurations when inputs are known or similar, and efficient search of the configuration space when inputs are completely new. Online autotuning outperforms configurations recommended in literature by up to 11% median. The prediction model achieves 95% of the maximum speedup of the autotuner while reducing 90% of its overhead. Thus, hybrid online autonuning enables always-on tuning in ray tracing.
Killian Herveau, Philip Pfaffe, Martin Peter Tillmann, Walter F. Tichy, Carsten Dachsbacher
IEEE Trans. Vis. Comput. Graph.1