Sciweavers

Share
GD
1998
Springer

Refinement of Orthogonal Graph Drawings

10 years 5 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends, crossings, and total edge length. Refinement is separate from layout and works by analyzing and then fine-tuning the existing drawing in an efficient manner. In this paper we define the problem and goals of orthogonal drawing refinement, review measures of a graph drawing's quality, and introduce a methodology which efficiently refines any orthogonal graph drawing. We have implemented our techniques in C++ and conducted experiments over a set of drawings from five well known orthogonal drawing systems. Experimental analysis shows our techniques to produce an average 37% improvement in area, 23% in bends, 25% in crossings, and 37% in total edge length. Communicated by G. Liotta and S. H. White...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G.
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where GD
Authors Janet M. Six, Konstantinos G. Kakoulis, Ioannis G. Tollis
Comments (0)
books