Graph Bundling by Kernel Density Estimation
- 25 June 2012
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 31 (3pt1), 865-874
- https://doi.org/10.1111/j.1467-8659.2012.03079.x
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Multilevel agglomerative edge bundling for visualizing large graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- 3D Edge Bundling for Geographical Data VisualizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Winding Roads: Routing edges into bundlesComputer Graphics Forum, 2010
- Force‐Directed Edge Bundling for Graph VisualizationComputer Graphics Forum, 2009
- Controllable and Progressive Edge Clustering for Large NetworksPublished by Springer Science and Business Media LLC ,2007
- Integrating Edge Routing into Force-Directed LayoutPublished by Springer Science and Business Media LLC ,2007
- Improved Circular LayoutsPublished by Springer Science and Business Media LLC ,2007
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar WayLecture Notes in Computer Science, 2004
- A Brief Survey of Bandwidth Selection for Density EstimationJournal of the American Statistical Association, 1996
- Non-Parametric Estimation of a Multivariate Probability DensityTheory of Probability and Its Applications, 1969