Incremental 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;NICTA Victoria Laboratory, Dept. of Comp. Science & Soft. Eng., University of Melbourne, Victoria, Australia
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 9
Cited 8

Visibility of disjoint polygons

Algorithmica
Shortest paths in the plane with convex polygonal obstacles

Information Processing Letters
A consistent hierarchical representation for vector data

SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
New methods for computing visibility graphs

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An output-sensitive algorithm for computing visibility

SIAM Journal on Computing
Proximity and reachability in the plane.

Proximity and reachability in the plane.
Computing the visibility graph of points within a polygon

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Direct Manipulation: A Step Beyond Programming Languages

Computer

Topology Preserving Constrained Graph Layout

Graph Drawing
Dunnart: A Constraint-Based Network Diagram Authoring Tool

Graph Drawing
Integrating edge routing into force-directed layout

GD'06 Proceedings of the 14th international conference on Graph drawing
Off-screen visualization techniques for class diagrams

Proceedings of the 5th international symposium on Software visualization
Fast edge-routing for large graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Orthogonal connector routing

GD'09 Proceedings of the 17th international conference on Graph Drawing
Orthogonal hyperedge routing

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Winding roads: routing edges into bundles

EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provides an initial automatic route when the connector is created and then modifies this when the connector end-points are moved. None that we know of ensure that the route is of minimal length while avoiding other objects in the diagram. We study the problem of incrementally computing minimal length object-avoiding poly-line connector routings. Our algorithms are surprisingly fast and allow us to recalculate optimal connector routings fast enough to reroute connectors even during direct manipulation of an object’s position, thus giving instant feedback to the diagram author.