期刊
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
卷 18, 期 12, 页码 2699-2708出版社
IEEE COMPUTER SOC
DOI: 10.1109/TVCG.2012.236
关键词
Graph layout; Laplacian matrix; force directed layout; stress model; merging; editing; crowd sourcing
资金
- National Natural Science Foundation of China [60903062, 61170204]
- 863 Program [2010AA012400]
In this paper, we propose a new strategy for graph drawing utilizing layouts of many sub-graphs supplied by a large group of people in a crowd sourcing manner. We developed an algorithm based on Laplacian constrained distance embedding to merge sub-graphs submitted by different users, while attempting to maintain the topological information of the individual input layouts. To facilitate collection of layouts from many people, a light-weight interactive system has been designed to enable convenient dynamic viewing, modification and traversing between layouts. Compared with other existing graph layout algorithms, our approach can achieve more aesthetic and meaningful layouts with high user preference.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据