Tidy Drawings of Trees

DOI10.1109/TSE.1979.234212MaRDI QIDQ4199581zbMATH OpenOpenAlexFDO

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)

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

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)