Incremental Connector Routing

Wybrow, Michael and Marriott, Kim and Stuckey, Peter J. (2006) Incremental Connector Routing. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 446-457(Official URL: http://dx.doi.org/10.1007/11618058_40).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/11618058_40
Classifications: M Methods > M.999 Others
M Methods > M.300 Dynamic / Incremental / Online
URI: http://gdea.informatik.uni-koeln.de/id/eprint/722

Actions (login required)

View Item View Item