A visibility drawing G of a planar graph G maps the vertices into non-overlapping horizontal segments (bars), and the edges into vertical segments (visibilities), each connecting the two bars corresponding to its two end-vertices.
CITATION STYLE
Liotta, G., & Montecchiani, F. (2015). L-visibility drawings of IC-planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 545–547). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_45
Mendeley helps you to discover research relevant for your work.