Abstract
We propose an approach that allows a user to explore a layout produced by any graph drawing algorithm, in order to reduce the visual complexity and clarify its presentation. Our approach is based on stratifying the drawing into layers with desired properties; layers can be explored and combined by the user to gradually acquire details. We present stratification heuristics, a user study, and an experimental analysis that evaluates how our stratification heuristics behave on the drawings computed by a variety of popular force-directed algorithms. © 2013 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F., & Tollis, I. G. (2013). Exploring complex drawings via edge stratification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 304–315). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
