Linear area upward drawings of AVL trees

被引：8

作者：

Crescenzi, P ^{[1
]}

Penna, P ^{[1
]}

Piperno, A ^{[1
]}

机构：

[1] Univ Rome La Sapienza, Dipartimento Sci Informaz, I-00198 Rome, Italy

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1998年 / 9卷 / 1-2期

关键词：

graph drawing; upward drawing; area requirement;

D O I：

10.1016/S0925-7721(97)00013-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. (C) 1998 Elsevier Science B.V.

引用

页码：25 / 42

页数：18