EDBT 2026 Demo / reviewers in the wild / expert
Eduardo M. Bringa
dblp:173/4175
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
0000-0002-1403-1954ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Visualization and visual analytics · 50% Geometric modeling and processing · 33% Image and video processing · 17% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › shape representation
distance field |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Image and video processing
feature extraction |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Visualization and visual analytics › topological data analysis
morse-smale complex |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Visualization and visual analytics
scientific visualization |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Visualization and visual analytics
topological data analysis |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Geometric modeling and processing › topology › computational topology
topological simplification |
0.1 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Computational science and engineering › materials science
materials science simulation |
0.0 | 1 | 2007 | Topologically Clean Distance Fields · IEEE Trans. Vis. Comput. Graph. 2007 |
Methods — techniques the papers use, named apart from their topics
morse theory · 0.1front advancement · 0.1critical point analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Topologically Clean Distance FieldsabstractAnalysis of the results obtained from material simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated porous solid as it is hit by a projectile. This paper describes two techniques for the generation of distance fields containing a minimal number of topological features, and we use them to identify features of the material. We focus on distance fields defined on a volumetric domain considering the distance to a given surface embedded within the domain. Topological features of the field are characterized by its critical points. Our first method begins with a distance field that is computed using a standard approach, and simplifies this field using ideas from Morse theory. We present a procedure for identifying and extracting a feature set through analysis of the MS complex, and apply it to find the invariants in the clean distance field. Our second method proceeds by advancing a front, beginning at the surface, and locally controlling the creation of new critical points. We demonstrate the value of topologically clean distance fields for the analysis of filament structures in porous solids. Our methods produce a curved skeleton representation of the filaments that helps material scientists to perform a detailed qualitative and quantitative analysis of pores, and hence infer important material properties. Furthermore, we provide a set of criteria for finding the "difference" between two skeletal structures, and use this to examine how the structure of the porous solid changes over several timesteps in the simulation of the particle impact. Attila Gyulassy, Mark A. Duchaineau, Vijay Natarajan, Valerio Pascucci, Eduardo M. Bringa, Andrew Higginbotham, Bernd Hamann |
IEEE Trans. Vis. Comput. Graph. | 5 |