Fast Edge-Routing for Large Graphs

Nachmanson, Lev and Dwyer, Tim (2010) Fast Edge-Routing for Large Graphs. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 147-158(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_15).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-11805-0_15
Classifications: P Styles > P.900 Visibility
G Algorithms and Complexity > G.560 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1081

Actions (login required)

View Item View Item