DeepAI AI Chat
Log In Sign Up

Simple Compact Monotone Tree Drawings

by   Anargyros Oikonomou, et al.
National Technical University of Athens

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 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.


page 1

page 2

page 3

page 4


Drawing planar graphs with few segments on a polynomial grid

The visual complexity of a plane graph drawing is defined to be the numb...

A better method to enforce monotonic constraints in regression and classification trees

In this report we present two new ways of enforcing monotone constraints...

Plane Spanning Trees in Edge-Colored Simple Drawings of K_n

Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line d...

Notes on Monotone Recognition in Multi-Valued Grids

Implementation details of method of monotone recognition, based on parti...

Searching by Heterogeneous Agents

In this work we introduce and study a pursuit-evasion game in which the ...

Generalized LR-drawings of trees

The LR-drawing-method is a method of drawing an ordered rooted binary tr...

Tree Drawings Revisited

We make progress on a number of open problems concerning the area requir...