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.
LINEAR AREA UPWARD DRAWINGS OF AVL TREES / P. CRESCENZI; P. PENNA P.; A. PIPERNO. - In: COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. - ISSN 0925-7721. - STAMPA. - 9:(1998), pp. 25-42. [10.1016/S0925-7721(97)00013-8]
LINEAR AREA UPWARD DRAWINGS OF AVL TREES
CRESCENZI, PIERLUIGI;
1998
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
