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 Kandinsky 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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Brandes, U., Eiglsperger, M., Kaufmann, M., & Wagner, D. (2002). Sketch-driven orthogonal graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 1–11). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
