3 research outputs found
Monotone Drawings of -Inner Planar Graphs
A -inner planar graph is a planar graph that has a plane drawing with at
most {internal vertices}, i.e., vertices that do not lie on the boundary of
the outer face of its drawing. An outerplanar graph is a -inner planar
graph. In this paper, we show how to construct a monotone drawing of a
-inner planar graph on a grid. In the special case
of an outerplanar graph, we can produce a planar monotone drawing on a grid, improving previously known results.Comment: Appears in the Proceedings of the 26th International Symposium on
Graph Drawing and Network Visualization (GD 2018). Revised introductio
Simple Compact Monotone Tree Drawings.
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction.
Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He [6] showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a 12n×12n
grid.
In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n×n