@techreport{TD:100286,
	att_abstract={{Graphs are often used to encapsulate relationships between
objects. Node-link diagrams, commonly used to visualize graphs, suffer
from visual clutter on large graphs. Edge bundling is an effective technique
for alleviating clutter and revealing high-level edge patterns.
Previous methods for general graph layouts either
require a control mesh to guide the bundling process, which can
introduce high variation in curvature along the bundles, or
all-to-all force and compatibility calculations, which is not
scalable.
We propose a multilevel agglomerative edge bundling method based on a
principled approach of minimizing ink needed to represent edges,
with additional constraints on the curvature of the resulting splines.
The proposed method is much faster than previous ones, able to bundle
hundreds of thousands of edges in seconds, and one million edges in
a few minutes. 
}},
	att_authors={eg3218, yh573v, sn1789, cs929g},
	att_categories={C_IIS.7},
	att_copyright={{IEEE}},
	att_copyright_notice={{}},
	att_donotupload={true},
	att_private={false},
	att_projects={},
	att_tags={ edge bundling,  de-cluttering, visualization},
	att_techdoc={true},
	att_techdoc_key={TD:100286},
	att_url={},
	author={Emden Gansner and Yifan Hu and Stephen North and Carlos Scheidegger},
	institution={{Proceeds of the 4th IEEE Pacific Visualization Symposium}},
	month={March},
	title={{Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs}},
	year=2011,
}