Abstract
In visualizations of large-scale transportation and communications networks, node coordinates are usually fixed to preserve the underlying geography, while links are represented as geodesics for simplicity. This often leads to severe readability problems due to poor angular resolution, i.e. small angles formed by lines converging in a node. We present a new method using automatically routed eubie curves that both preserves node coordinates and eliminates the resolution problem. The approach is applied to representations in the plane and on the sphere, showing European train connections and Internet traffic, respectively.
Research partially supported by the U.S. National Science Foundation under grants CCR-9732327 and CDA-9703080, by the U.S. Army Research Office under grant DAAH04-96-1-0013, and by the German Academic Exchange Service (DAAD, Hochschulsonderprogramm III).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Abello and E.R. Gansner. Short and smooth polygonal paths. Proc. 3rd Latin American Symp. Theoretical Informatics (LATIN ’98), LNCS vol. 1380, pp. 151-162. Springer, 1998.
N. Amenta, S. Levy, T. Munzner, and M. Phillips. Geomview: A system for geometric visualization. In Proc. llth ACM Ann. Symp. Computational Geometry (SoCG ’95), pp. C12-13. ACM, 1995.
R.A. Becker, S.G. Eick, and A.R. Wilks. Visualizing network data. IEEE Transactions on Visualization and Graphics, 1(1): 16–28, 1995.
P. Bézier. Numerical Control. John Wiley &; Sons, 1972.
W. Boehm. On cubics: A survey. Computer Graphics and Image Processing, 19:201–226 1982.
U. Brandesand D. Wagner. Using graph layout to visualize train interconnection data. Proc. 6th Intl. Symp. Graph Drawing (GD ’98), LNCS vol. 1547, pp. 44-56. Springer, 1998.
K.C. Cox, S.G. Eick, and T. He. 3D geographic network displays. ACM SIGMOD Record, 24(4):50–54, 1996.
D.P. Dobkin, E.R. Gansner, E. Koutsofios, and S.C. North. Implementing a general-purpose edge router. Proc. 5th Intl. Symp. Graph Drawing (GD ’97), LNCS vol. 1353, pp. 262-271. Springer, 1997.
M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Symvonis, E. Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. SIAM Journal on Computing, 22(5)1035–1052 1993.
E.R. Gansner and S.C. North. Improved force-directed layouts. Proc. 6th Intl. Symp. Graph Drawing (GD ’98), LNCS vol. 1547, pp. 364-373. Springer, 1998.
A. Garg. On drawing angle graphs. Proc. 2nd Intl. Symp. Graph Drawing (GD ’94), LNCS vol. 894, pp. 84-95. Springer, 1995.
A. Garg and R. Tamassia.Planar drawings and angular resolution: Algorithms and bounds. Proc. 2nd European Symp. Algorithms (ESA ’94), LNCS vol. 855, pp. 12-23. Springer, 1994.
M.T. Goodrich and C.G. Wagner. A framework for drawing planar graphs with curves and polylines. Proc. 6th Intl. Symp. Graph Drawing (GD ’98), LNCS vol. 1547, pp. 153-166. Springer, 1998.
C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. Proc. 6th Intl. Symp. Graph Drawing (GD ’98), LNCS vol. 1547, pp. 167-182. Springer, 1998.
H. Hagen. Bezier-curves with curvature and torsion continuity. Rocky Mountain Journal of Mathematics, 16(3)629–638 1986.
G. Kant. Drawing planar graphs using the canonical ordering.Algorithmica, 16:4–32 1996.
K.A. Lyons, H. Meijer, D. Rappaport. Algorithms for Cluster busting in anchored graph drawing. Journal on Graph Algorithms and Applications, 2(1)1–24 1998.
S. Malitzand A. Papakostas. On the angular resolution of planar graphs. SIAM Journal on Discrete Mathematics, 7(2) 172–183, 1994.
K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial Geometric Computing. Cambridge University Press, 1999. http://www.mpi-sb.mpg.de/LEDA/.
T. Munzner, E. Hoffman, K. Claffy, and B. Fenner.Visualizing the global topology of the MBone. Proc. 1996 IEEE Symp. Information Visualization, pp. 85-92, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandes, U., Shubina, G., Tamassia, R. (2000). Improving Angular Resolution in Visualizations of Geographic Networks. In: de Leeuw, W.C., van Liere, R. (eds) Data Visualization 2000. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6783-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6783-0_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83515-9
Online ISBN: 978-3-7091-6783-0
eBook Packages: Springer Book Archive