Towards shortest longest edges in orthogonal graph drawing

Gronemann, Martin and J√ľnger, Michael and Mallach, Sven and Schmidt, Daniel R. (2011) Towards shortest longest edges in orthogonal graph drawing.
Technical Report , 6 p.

Abstract

Inspired by a challenge during Graph Drawing 2010 "Find an orthogonal drawing whose longest edge is as short as possible", we investigate techniques to incorporate this goal into the "standard" topology-shape-metrics approach at moderate extra computational complexity. Experiments indicate that this project is worth pursuing.


Actions:
Download: [img] PDF
Download (127Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2011-634
Depositing User: Sven Mallach
Date Deposited: 05 Dec 2011 12:47
Last Modified: 19 Dec 2011 09:44
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/634