Depth-first layout algorithm for trees.

DOI10.1016/S0020-0190(98)00068-4zbMATH Open1078.68806OpenAlexW2062133944MaRDI QIDQ2583560FDOQ2583560

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

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

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

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

Cited In (5)

• An algorithm for blob hierarchy layout
• Object-oriented tree traversal with JJForester.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Offline drawing of dynamic trees: algorithmics and document integration

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)