期刊
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
卷 18, 期 12, 页码 2486-2495出版社
IEEE COMPUTER SOC
DOI: 10.1109/TVCG.2012.238
关键词
Graph visualization; OpenGL; edge aggregation
资金
- Deutsche Forschungsgemeinschaft (DFG), Konstanz [GK-1042]
We propose a technique that allows straight-line graph drawings to be rendered interactively with adjustable level of detail. The approach consists of a novel combination of edge cumulation with density-based node aggregation and is designed to exploit common graphics hardware for speed. It operates directly on graph data and does not require precomputed hierarchies or meshes. As proof of concept, we present an implementation that scales to graphs with millions of nodes and edges, and discuss several example applications.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据