Drawing complete binary trees inside rectilinear polygons

DOI10.1080/00207160903154733MaRDI QIDQ3066961zbMATH OpenOpenAlexFDO

Authors Alireza Bagheri, Mohammadreza Razzazi

Publication date 20 January 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160903154733

zbMATH Keywords

binary treegraph drawingH-tree layoutpolygon bisectingrectilinear polygon

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• How to draw free trees inside bounded rectilinear polygons
• Algorithms for drawing binary trees in the plane.
• Straight-Line Orthogonal Drawings of Binary and Ternary Trees
• Graph Drawing
• scientific article; zbMATH DE number 1974131

Cited in

(5)

• Drawing trees with perfect angular resolution and polynomial area
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• How to draw free trees inside bounded rectilinear polygons
• Constrained point set embedding of a balanced binary tree
• Drawing free trees inside simple polygons using polygon skeleton

This page was built for publication: Drawing complete binary trees inside rectilinear polygons

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