Advertisement

Algorithmica

, Volume 34, Issue 1, pp 1–13 | Cite as

A Near-Linear Area Bound for Drawing Binary Trees

Article

Abstract

We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n -node binary tree. In particular, it is shown that O(n 1+ɛ ) area is always sufficient for an arbitrary constant ɛ>0 .

Key words. Graph drawing, Trees. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York 2002

Authors and Affiliations

  • Chan
    • 1
  1. 1.Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. tmchan@math.uwaterloo.ca.CA

Personalised recommendations