Depth-first layout algorithm for trees.

DOI10.1016/S0020-0190(98)00068-4zbMath1078.68806OpenAlexW2062133944MaRDI QIDQ2583560

Takeo Yaku, Youzou Miyadera, Koushi Anzai, Hiroshi Unno

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 geometryComputational complexityHichartTidy drawing problemTree layoutTree-structured diagram

Mathematics Subject Classification ID

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

Cites Work

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

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