Sketch-Driven Orthogonal Graph Drawing

Brandes, Ulrik and Eiglsperger, Markus and Kaufmann, Michael and Wagner, Dorothea (2002) Sketch-Driven Orthogonal Graph Drawing. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 131-148(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_1).

Full text not available from this repository.

Abstract

We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kadinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal graph drawing.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-36151-0_1
Classifications: M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/225

Actions (login required)

View Item View Item