Demo Data from EDBT 2026 / reviewers in the wild / expert
Herbert Grasberger
dblp:41/8338
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 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
2 papers |
Geometric modeling and processing · 82% Image and video processing · 18% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
spatial data structures |
0.2 | 1 | 2016 | Efficient data-parallel tree-traversal for BlobTrees · Comput. Aided Des. 2016 |
Geometric modeling and processing › solid modeling
constructive solid geometry |
0.2 | 1 | 2013 | A gradient-based implicit blend · ACM Trans. Graph. 2013 |
Image and video processing › gradient-domain image processing
gradient-domain blending |
0.2 | 1 | 2013 | A gradient-based implicit blend · ACM Trans. Graph. 2013 |
Geometric modeling and processing › shape modeling
implicit modeling |
0.2 | 1 | 2013 | A gradient-based implicit blend · ACM Trans. Graph. 2013 |
Geometric modeling and processing
implicit surface |
0.2 | 1 | 2013 | A gradient-based implicit blend · ACM Trans. Graph. 2013 |
Parallel and multicore computing
data-parallel programming |
0.1 | 1 | 2016 | Efficient data-parallel tree-traversal for BlobTrees · Comput. Aided Des. 2016 |
Methods — techniques the papers use, named apart from their topics
data-parallel tree traversal · 0.5GPU evaluation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Efficient data-parallel tree-traversal for BlobTrees
Herbert Grasberger, Jean-Luc Duprat, Brian Wyvill, Paul Lalonde, Jarek Rossignac |
Comput. Aided Des. | 1 |
| 2013 | A gradient-based implicit blendabstractWe introduce a new family of binary composition operators that solves four major problems of constructive implicit modeling: suppressing bulges when two shapes merge, avoiding unwanted blending at a distance, ensuring that the resulting shape keeps the topology of the union, and enabling sharp details to be added without being blown up. The key idea is that field functions should not only be combined based on their values, but also on their gradients . We implement this idea through a family of C ∞ composition operators evaluated on the GPU for efficiency, and illustrate it by applications to constructive modeling and animation. Olivier Gourmel, Loïc Barthe, Marie-Paule Cani, Brian Wyvill, Adrien Bernhardt, Mathias Paulin, Herbert Grasberger |
ACM Trans. Graph. | 7 |
| 2010 | Precise Construction and Control of Implicit Fillets in the BlobTreeabstractSkeletal implicit modelling systems have been used to design models of both organic and man-made structures, however existing systems lack convenient and accurate methods for users to define fillets when building prototype engineering models. In this work we extend the methodology and skeletal primitives found in the BlobTree and introduce an improved method for modelling fillets. This is done by interpolating between hard-edged and soft-edged representations of a primitive, using the field to control the interpolation. Blending planes are introduced as a way of providing user control for this interpolation. The new methods are expressed as blend operators between two objects and can thus be implemented as a new node in the BlobTree. In addition we introduce an efficient methodology for modelling hard edged primitives. Herbert Grasberger, Andrea Weidlich, Alexander Wilkie, Brian Wyvill |
Shape Modeling International | 1 |