Tidy Drawings of Trees

DOI10.1109/TSE.1979.234212zbMATH Open0412.68092OpenAlexW2002278016MaRDI QIDQ4199581FDOQ4199581

Authors: Charles Wetherell, Alfred Shannon 

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

zbMATH Keywords

binary treesdata structurescomputer graphicsgraphics devicestree drawers

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (9)

• Drawing plane graphs nicely
• A data-parallel algorithm for minimum-width tree layout
• Depth-first layout algorithm for trees.
• Functional Pearls
• Exploring the Design Space of Aesthetics with the Repertory Grid Technique
• A note on optimal area algorithms for upward drawings of binary trees
• Functional Pearls
• Drawing trees with perfect angular resolution and polynomial area
• Offline drawing of dynamic trees: algorithmics and document integration

This page was built for publication: Tidy Drawings of Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199581)