Orthogonal connector routing

Authors:
Michael Wybrow;Kim Marriott;Peter J. Stuckey
Affiliations:
Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia;Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia;National ICT Australia, Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Victoria, Australia
Venue:
GD'09 Proceedings of the 17th international conference on Graph Drawing
Year:
2009

Citing 10
Cited 2

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

IEEE Transactions on Computers
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Rectilinear paths among rectilinear obstacles

Discrete Applied Mathematics
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Implementing a General-Purpose Edge Router

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

Graph Drawing
Fast node overlap removal: correction

GD'06 Proceedings of the 14th international conference on Graph drawing
Line crossing minimization on metro maps

GD'07 Proceedings of the 15th international conference on Graph drawing
Fast node overlap removal

GD'05 Proceedings of the 13th international conference on Graph Drawing
Incremental connector routing

GD'05 Proceedings of the 13th international conference on Graph Drawing

Orthogonal hyperedge routing

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Aesthetic layout of wiring diagrams

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference

Quantified Score

Hi-index	0.00

Visualization

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.