How to draw free trees inside bounded rectilinear polygons

DOI10.1080/0020716042000261423MaRDI QIDQ4652864zbMATH OpenOpenAlexFDO

Authors Alireza Bagheri, Mohammadreza Razzazi

Publication date 28 February 2005

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

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

zbMATH Keywords

algorithmcomputational geometrygraph drawingnumerical examplessimulated annealing method

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Drawing free trees inside simple polygons using polygon skeleton
• Drawing complete binary trees inside rectilinear polygons
• Algorithms for drawing binary trees in the plane.
• Drawing a tree on parallel lines
• Trees with Convex Faces and Optimal Angles

Cited in

(2)

• Drawing complete binary trees inside rectilinear polygons
• Drawing free trees inside simple polygons using polygon skeleton

This page was built for publication: How to draw free trees inside bounded rectilinear polygons

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