A Visualization Framework and User Studies for Overloaded Orthogonal Drawings

Simple item page
dc.contributor.authorDidimo, Walteren_US
dc.contributor.authorKornaropoulos, Evgenios M.en_US
dc.contributor.authorMontecchiani, Fabrizioen_US
dc.contributor.authorTollis, Ioannis G.en_US
dc.contributor.editorChen, Min and Benes, Bedrichen_US
dc.date.accessioned2018-04-05T12:48:41Z
dc.date.available2018-04-05T12:48:41Z
dc.date.issued2018
dc.description.abstractOverloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular drawing conventions like layered drawings and orthogonal drawings, and provides additional support for some common analysis tasks. We present a visualization framework called , which implements algorithms and graphical features for the OOD style. Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking into account user preferences and constraints. It also supports an interactive visualization of clustered digraphs, based on the use of strongly connected components. Moreover, we describe an experimental user study, aimed to investigate the usability of OOD within the DAGView framework. The results of our study suggest that OOD can be effectively exploited to perform some basic tasks of analysis in a faster and more accurate way when compared to other drawing styles for directed graphs.Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular drawing conventions like layered drawings and orthogonal drawings, and provides additional support for some common analysis tasks. We present a visualization framework called , which implements algorithms and graphical features for the OOD style. Besides the algorithm for acyclic digraphs, the DAGView framework implements extensions to visualize both digraphs with cycles and undirected graphs, with the additional possibility of taking into account user preferences and constraints.en_US
dc.description.number1
dc.description.sectionheadersArticles
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume37
dc.identifier.doi10.1111/cgf.13266
dc.identifier.issn1467-8659
dc.identifier.pages288-300
dc.identifier.urihttps://doi.org/10.1111/cgf.13266
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13266
dc.publisher© 2018 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectuser studies
dc.subjectinteraction
dc.subjectinformation visualization
dc.subjectvisualization
dc.subjecthuman–computer interfaces
dc.subjectinteraction
dc.subjectH.5.2 [INFORMATION SYSTEMS APPLICATIONS]: User Interfaces Graphical user interfaces (GUI); I.3.5 [COMPUTER GRAPHICS]: Computational Geometry and Object Modeling Geometric algorithms
dc.subjectlanguages
dc.subjectand systems; G.2.2 [DISCRETE MATHEMATICS]: Graph Theory Graph algorithms
dc.titleA Visualization Framework and User Studies for Overloaded Orthogonal Drawingsen_US
Files
Collections
37-Issue 1