Generalizing Geometric Graphs
Vol. 18, no. 1, pp. 35-76, 2014. Regular paper.
Abstract 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. We show that these problems are NP-hard in general, and provide efficient approximation algorithms as well as efficient and effective heuristics. We also showcase some sample generalizations.
Submitted: March 2013.
Reviewed: August 2013.
Revised: October 2013.
Reviewed: December 2013.
Revised: January 2014.
Accepted: January 2014.
Final: January 2014.
Published: January 2014.
Communicated by Stephen G. Kobourov
article (PDF)