Proximity drawings of binary trees in polynomial area

In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the number of vertices. Additionally, an exponential lower bound on the area of (weak) proximity drawings of general graph has been proved. We present the rst algorithms that compute a polynomial area {proximity drawing of binary and ternary trees. The algorithms run in linear time.

• Type: Conference
• Year: 1998
• Where: CCCG
• Authors: Paolo Penna, Paola Vocca
• Keywords: CCCG 1998, CCCG 2007, Drawings Produce Representations, Proximity Drawings, Weak {proximity Drawings