Depth-first layout algorithm for trees.

DOI10.1016/S0020-0190(98)00068-4MaRDI QIDQ2583560zbMATH OpenOpenAlexFDO

Authors Youzou Miyadera, Koushi Anzai, Hiroshi Unno, Takeo Yaku

Publication date 17 January 2006

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00068-4

zbMATH Keywords

Computational complexityComputational geometryHichartTidy drawing problemTree layoutTree-structured diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 51986
• Algorithms for drawing binary trees in the plane.
• Trees for algorithmics
• A recursive algorithm for trees and forests
• Dynamic tree algorithms
• Treewidth: Structure and Algorithms
• A bounded-space tree traversal algorithm
• scientific article; zbMATH DE number 4091527

Cites work

• The complexity of drawing trees nicely
• Tidy Drawings of Trees

Cited in

(6)

• An algorithm for blob hierarchy layout
• Object-oriented tree traversal with JJForester.
• scientific article; zbMATH DE number 1693469 (Why is no real title available?)
• Offline drawing of dynamic trees: algorithmics and document integration
• scientific article; zbMATH DE number 2080103 (Why is no real title available?)
• Functional Pearls

This page was built for publication: Depth-first layout algorithm for trees.

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