EDBT 2026 Demo / reviewers in the wild / expert
Magdalena Martinek
dblp:195/2519
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 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 |
Geometric modeling and processing · 67% Rendering · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › spatial data structures
bounding volume hierarchy |
0.3 | 1 | 2017 | A Compressed Representation for Ray Tracing Parametric Surfaces · ACM Trans. Graph. 2017 |
Rendering
ray tracing |
0.3 | 1 | 2017 | A Compressed Representation for Ray Tracing Parametric Surfaces · ACM Trans. Graph. 2017 |
Geometric modeling and processing › mesh processing
surface compression |
0.3 | 1 | 2017 | A Compressed Representation for Ray Tracing Parametric Surfaces · ACM Trans. Graph. 2017 |
Methods — techniques the papers use, named apart from their topics
approximate evaluation · 0.3BVH compression · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Spatio-temporal filtered motion DAGs for path-tracing
Magdalena Martinek, Philip Thiemann, Marc Stamminger |
Comput. Graph. | 1 |
| 2017 | A Compressed Representation for Ray Tracing Parametric SurfacesabstractParametric surfaces are an essential modeling tool in computer aided design and movie production. Even though their use is well established in industry, generating ray-traced images adds significant cost in time and memory consumption. Ray tracing such surfaces is usually accomplished by subdividing the surfaces on the fly, or by conversion to a polygonal representation. However, on-the-fly subdivision is computationally very expensive, whereas polygonal meshes require large amounts of memory. This is a particular problem for parametric surfaces with displacement, where very fine tessellation is required to faithfully represent the shape. Hence, memory restrictions are the major challenge in production rendering. In this article, we present a novel solution to this problem. We propose a compression scheme for a priori Bounding Volume Hierarchies (BVHs) on parametric patches, that reduces the data required for the hierarchy by a factor of up to 48. We further propose an approximate evaluation method that does not require leaf geometry, yielding an overall reduction of memory consumption by a factor of 60 over regular BVHs on indexed face sets and by a factor of 16 over established state-of-the-art compression schemes. Alternatively, our compression can simply be applied to a standard BVH while keeping the leaf geometry, resulting in a compression rate of up to 2:1 over current methods. Although decompression generates additional costs during traversal, we can manage very complex scenes even on the memory restrictive GPU at competitive render times. Kai Selgrad, Alexander Lier, Magdalena Martinek, Christoph Buchenau, Michael Guthe, Franziska Kranz, Henry Schäfer, Marc Stamminger |
ACM Trans. Graph. | 3 |