Demo Data from VLDB 2026 / reviewers in the wild / expert
Fahai Zhong
dblp:336/6737
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-0971-0821ORCID · corroborated
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 · 2 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
2 papers |
Visualization and visual analytics · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization › graph drawing
force-directed layout |
0.8 | 1 | 2024 | Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution · IEEE Trans. Vis. Comput. Graph. 2024 |
Visualization and visual analytics
graph visualization |
0.8 | 1 | 2024 | Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution · IEEE Trans. Vis. Comput. Graph. 2024 |
Visualization and visual analytics › dimensionality reduction
neighborhood preservation |
0.8 | 1 | 2024 | Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution · IEEE Trans. Vis. Comput. Graph. 2024 |
Visualization and visual analytics › graph visualization
graph layout |
0.7 | 1 | 2023 | Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout · IEEE Trans. Vis. Comput. Graph. 2023 |
Visualization and visual analytics
stress model |
0.7 | 1 | 2023 | Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout · IEEE Trans. Vis. Comput. Graph. 2023 |
Visualization and visual analytics
interactive visualization |
0.2 | 1 | 2024 | Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution · IEEE Trans. Vis. Comput. Graph. 2024 |
Methods — techniques the papers use, named apart from their topics
student's t-distribution force · 0.8fast fourier transform · 0.8GPU acceleration · 0.8stress majorization · 0.7stochastic gradient descent · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Force-Directed Graph Layouts Revisited: A New Force Based on the T-DistributionabstractIn this article, we propose the t-FDP model, a force-directed placement method based on a novel bounded short-range force (t-force) defined by Student's t-distribution. Our formulation is flexible, exerts limited repulsive forces for nearby nodes and can be adapted separately in its short- and long-range effects. Using such forces in force-directed graph layouts yields better neighborhood preservation than current methods, while maintaining low stress errors. Our efficient implementation using a Fast Fourier Transform is one order of magnitude faster than state-of-the-art methods and two orders faster on the GPU, enabling us to perform parameter tuning by globally and locally adjusting the t-force in real-time for complex graphs. We demonstrate the quality of our approach by numerical evaluation against state-of-the-art approaches and extensions for interactive exploration. Fahai Zhong, Mingliang Xue, Jian Zhang 0070, Fan Zhang 0045, Rui Ban, Oliver Deussen, Yunhai Wang |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2023 | Taurus: Towards a Unified Force Representation and Universal Solver for Graph LayoutabstractOver the past few decades, a large number of graph layout techniques have been proposed for visualizing graphs from various domains. In this paper, we present a general framework, Taurus, for unifying popular techniques such as the spring-electrical model, stress model, and maxent-stress model. It is based on a unified force representation, which formulates most existing techniques as a combination of quotient-based forces that combine power functions of graph-theoretical and Euclidean distances. This representation enables us to compare the strengths and weaknesses of existing techniques, while facilitating the development of new methods. Based on this, we propose a new balanced stress model (BSM) that is able to layout graphs in superior quality. In addition, we introduce a universal augmented stochastic gradient descent (SGD) optimizer that efficiently finds proper solutions for all layout techniques. To demonstrate the power of our framework, we conduct a comprehensive evaluation of existing techniques on a large number of synthetic and real graphs. We release an open-source package, which facilitates easy comparison of different graph layout methods for any graph input as well as effectively creating customized graph layout techniques. Mingliang Xue, Fahai Zhong, Yong Wang 0021, Mingliang Xu 0001, Oliver Deussen, Yunhai Wang |
IEEE Trans. Vis. Comput. Graph. | 3 |