Skip to main content
SpringerLink
Log in

A Near-Linear Area Bound for Drawing Binary Trees

  • Published:
Algorithmica Aims and scope Submit manuscript

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(n1+ɛ) area is always sufficient for an arbitrary constant ɛ>0 .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

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

    Chan

Authors
  1. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chan A Near-Linear Area Bound for Drawing Binary Trees . Algorithmica 34, 1–13 (2002). https://doi.org/10.1007/s00453-002-0937-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-002-0937-x

Search

Navigation