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

Levente Sipeki

dblp:137/2133 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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 · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › graph visualization › graph drawing
directed graph layout
0.212013
Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields · IEEE Trans. Vis. Comput. Graph. 2013
Visualization and visual analytics
graph visualization
0.212013
Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields · IEEE Trans. Vis. Comput. Graph. 2013
Visualization and visual analytics
topological data analysis
0.212013
Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields · IEEE Trans. Vis. Comput. Graph. 2013
Visualization and visual analytics › topological data analysis
vector field topology
0.212013
Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields · IEEE Trans. Vis. Comput. Graph. 2013

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

topology simplification · 0.2piecewise constant vector field · 0.2
YearPublicationVenuePosition
2013 Visualization of Morse Connection Graphs for Topologically Rich 2D Vector Fields
abstract
Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.
Andrzej Szymczak, Levente Sipeki
IEEE Trans. Vis. Comput. Graph.2