Tidy Drawings of Trees
From MaRDI portal
Publication:4199581
DOI10.1109/TSE.1979.234212zbMath0412.68092OpenAlexW2002278016MaRDI QIDQ4199581
Alfred Shannon, Charles Wetherell
Publication date: 1979
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tse.1979.234212
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Data structures (68P05)
Related Items (9)
A data-parallel algorithm for minimum-width tree layout ⋮ Functional Pearls ⋮ Functional Pearls ⋮ Offline Drawing of Dynamic Trees: Algorithmics and Document Integration ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ A note on optimal area algorithms for upward drawings of binary trees ⋮ Drawing plane graphs nicely ⋮ Exploring the Design Space of Aesthetics with the Repertory Grid Technique ⋮ Depth-first layout algorithm for trees.
This page was built for publication: Tidy Drawings of Trees
