Abstract
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity, planarity, and convexity, and we outline a number of open problems and future research directions. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Angelini, P., Colasante, E., Di Battista, G., Frati, F., & Patrignani, M. (2011). Monotone drawings of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 13–24). https://doi.org/10.1007/978-3-642-18469-7_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
