Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number of nodes. In this paper we explore two ideas for achieving faster edge routing using approximate shortest-path techniques.
- 3.Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: STOC 1987: Nineteenth, New York (May 1987)Google Scholar
- 7.Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 230–241. Springer, Heidelberg (2009), http://www.csse.monash.edu.au/~tdwyer/topology.pdf CrossRefGoogle Scholar