46

Drawing Trees*

Sebastian Leipert

Center of Advanced European Studies and Research

46.1Introduction

46.2Preliminaries

46.3Level Layout for Binary Trees

46.4Level Layout for n-ary Trees

PrePositionCombining a Subtree and its Left SubforestAncestorApportionShifting the Smaller Subtrees

46.5Radial Layout

46.6HV-Layout

Acknowledgments

References

46.1Introduction

Constructing geometric representations of graphs in a readable and efficient way is crucial for understanding the inherent properties of the structures in many applications. The desire to generate a layout of such representations by algorithms and not by hand meeting certain aesthetics has motivated the research area Graph Drawing. Examples of these aesthetics include minimizing the ...

Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.