A near-linear area bound for drawing binary trees

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)1-13
Number of pages13
JournalAlgorithmica (New York)
Volume34
Issue number1
DOIs
StatePublished - Jan 1 2002
Externally publishedYes

Keywords

  • Graph drawing
  • Trees

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A near-linear area bound for drawing binary trees'. Together they form a unique fingerprint.

Cite this