EDBT 2026 Demo / reviewers in the wild / expert
Han Krishnan
dblp:68/6110
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0001-8018-0547ORCID · reported
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 · 87% Geometric modeling and processing · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
flow visualization |
0.1 | 1 | 2008 | Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields · IEEE Trans. Vis. Comput. Graph. 2008 |
Visualization and visual analytics › flow visualization
unsteady flow visualization |
0.1 | 1 | 2008 | Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields · IEEE Trans. Vis. Comput. Graph. 2008 |
Geometric modeling and processing
surface fitting |
0.0 | 1 | 2008 | Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields · IEEE Trans. Vis. Comput. Graph. 2008 |
Methods — techniques the papers use, named apart from their topics
triangulation · 0.1iterative refinement · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Generation of Accurate Integral Surfaces in Time-Dependent Vector FieldsabstractWe present a novel approach for the direct computation of integral surfaces in time-dependent vector fields. As opposed to previous work, which we analyze in detail, our approach is based on a separation of integral surface computation into two stages: surface approximation and generation of a graphical representation. This allows us to overcome several limitations of existing techniques. We first describe an algorithm for surface integration that approximates a series of time lines using iterative refinement and computes a skeleton of the integral surface. In a second step, we generate a well-conditioned triangulation. Our approach allows a highly accurate treatment of very large time-varying vector fields in an efficient, streaming fashion. We examine the properties of the presented methods on several example datasets and perform a numerical study of its correctness and accuracy. Finally, we investigate some visualization aspects of integral surfaces. Christoph Garth, Han Krishnan, Xavier Tricoche, Tom Tricoche, Kenneth I. Joy |
IEEE Trans. Vis. Comput. Graph. | 2 |