Orthogonal Connector Routing

Wybrow, Michael and Marriott, Kim and Stuckey, Peter J. (2010) Orthogonal Connector Routing. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 219-231(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_22).

Full text not available from this repository.

Abstract

Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connector routing. However, these tools use ad-hoc heuristics that can lead to strange routes and even routes that pass through other objects. We present an algorithm for computing optimal object-avoiding orthogonal connector routings where the route minimizes a monotonic function of the connector length and number of bends. The algorithm is efficient and can calculate connector routings fast enough to reroute connectors during interaction.

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

Actions (login required)

View Item View Item