28
Views
2
CrossRef citations to date
0
Altmetric
Miscellany

How to draw free trees inside bounded rectilinear polygons

&
Pages 1329-1339 | Received 22 Feb 2004, Published online: 25 Jan 2007
 

Abstract

Drawing graphs on a 2D grid with prescribed size is NP-complete, even if we restrict ourselves to planar orthogonal grid drawings of trees. In this paper, we introduce a new algorithm for polyline drawing of free trees on 2D grids which are bounded by rectilinear polygons. Our algorithm uses straight skeleton and simulated annealing and aims to distribute the vertices of the given trees uniformly on the given bounded grids. Our experimental results show that our algorithm is relatively successful to achieve uniform distribution of the nodes of the given trees. To our knowledge, this paper is the first attempt to develop algorithms that draw trees on restricted 2D grids which are bounded by simple rectilinear polygons.

E-mail: [email protected]

Acknowledgement

This research was in part supported by a grant from I.P.M. (No. CS1383-4-1).

Notes

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.