Simple Compact Monotone Tree Drawings.

Oikonomou, Anargyros and Symvonis, Antonios (2017) Simple Compact Monotone Tree Drawings. In: Graph Drawing and Network Visualization. GD 2017, September 25-27 , pp. 326-333(Official URL: https://doi.org/10.1007/978-3-319-73915-1_26).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Classifications: M Methods > M.900 Tree
P Styles > P.840 Upward
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1613

Actions (login required)

View Item View Item