New upper bounds for neighbor searching
Information and Control
CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Discrete Mathematics - Topics on domination
Graphical fisheye views of graphs
CHI '92 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Map Generalization as a Graph Drawing Problem
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
IEEE Transactions on Knowledge and Data Engineering
LunarVis - analytic visualizations of large graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Optimal binary space partitions in the plane
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visualizing large graphs with compound-fisheye views and treemaps
GD'04 Proceedings of the 12th international conference on Graph Drawing
Image-based edge bundles: simplified visualization of large graphs
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
Network visualization is essential for understanding the data obtained from huge real-world networks such as flight-networks, the AS-network or social networks. Although we can compute layouts for these networks reasonably fast, even the most recent display media are not capable of displaying these layouts in an adequate way. Moreover, the human viewer may be overwhelmed by the displayed level of detail. The increasing amount of data therefore requires techniques aiming at a sensible reduction of the visual complexity of huge layouts. We consider the problem of computing a generalization of a given layout reducing the complexity of the drawing to an amount that can be displayed without clutter and handled by a human viewer. We take a first step at formulating graph generalization within a mathematical model and we consider the resulting problems from an algorithmic point of view. Although these problems are NP-hard in general, we provide efficient approximation algorithms as well as efficient and effective heuristics. At the end of the paper we showcase some sample generalizations.