JUCS - Journal of Universal Computer Science 11(6): 804-829, doi: 10.3217/jucs-011-06-0804
How to Draw Free Trees Inside Bounded Simple Polygons
expand article infoAlireza Bagheri‡, Mohammadreza Razzazi‡
‡ Software Systems R&D Laboratory Department of Computer Engineering & IT Amirkabir University of Technology, Tehran, Iran

Corresponding author: Alireza Bagheri ( bagheri@ce.aut.ac.ir )

© Alireza Bagheri, Mohammadreza Razzazi.
This article is freely available under the J.UCS Open Content License.
Citation: Bagheri A, Razzazi M (2005) How to Draw Free Trees Inside Bounded Simple Polygons. JUCS - Journal of Universal Computer Science 11(6): 804-829. https://doi.org/10.3217/jucs-011-06-0804
Open Access
Abstract
In this paper we investigate polyline grid drawing of free trees on 2D grids which are bounded by simple polygons. We focus on achieving uniform node distribution while we also try to achieve minimum edge crossings. We do not consider achieving symmetry as a mandatory task, but our algorithm can exploit some symmetries present in both the given trees and the given polygons. To our knowledge, our work is the first attempt for developing algorithms that draw graphs on regions which are bounded by simple polygons.
Keywords
computational geometry, graph drawing, simulated annealing, free trees, straight skeleton