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

OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES / P. CRESCENZI; A. PIPERNO. - STAMPA. - (1994), pp. 307-317. ((Intervento presentato al convegno INTERNATIONAL WORKSHOP ON GRAPH DRAWING.

OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES

CRESCENZI, PIERLUIGI;
1994

Abstract

We prove that any AVL tree admits a linear-area planar straight-line grid strictly-upward drawing, that is, a drawing in which (a) no two edges intersect, (b) each edge is mapped into a single straight-line segment, (c) each node is mapped into a point with integer coordinates, and (d) each node is placed below its parent.
Graph Drawing
INTERNATIONAL WORKSHOP ON GRAPH DRAWING
P. CRESCENZI; A. PIPERNO
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2158/237689
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact