Paper Info
Title
Overloaded orthogonal drawings
Abstract
Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these drawings we use an overloading technique. All algorithms are simple and easy to implement and can be applied to directed acyclic graphs, planar, non-planar and also undirected graphs. We also present bounds on the number of bends and the area. Overloaded Orthogonal drawings present several interesting properties such as efficient visual edge confirmation as well as simplicity and clarity of the drawing.
Year
DOI
Venue
2011
10.1007/978-3-642-25878-7_24
Graph Drawing
Keywords
Field
DocType
acyclic graph,dominance drawing,edge routing,overloading technique,efficient visual edge confirmation,present bound,high clarity,weak dominance condition,orthogonal drawing,overloaded orthogonal drawing
Graph drawing,Discrete mathematics,Combinatorics,Outerplanar graph,Vertex (geometry),Computer science,Algorithm,Directed acyclic graph,Planar,Dominance drawing,Transitive closure,Grid
Conference
Volume
ISSN
Citations 
7034
0302-9743
3
PageRank 
References 
Authors
0.40
18
2
Name
Order
Citations
PageRank
Evgenios M. Kornaropoulos1697.16
Ioannis G. Tollis21240162.75