How to Draw Free Trees Inside Bounded Simple Polygons

Alireza Bagheri (Software Systems R&D Laboratory Department of Computer Engineering & IT Amirkabir University of Technology, Iran)

Mohammadreza Razzazi (Software Systems R&D Laboratory Department of Computer Engineering & IT Amirkabir University of Technology, Iran)

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, free trees, graph drawing, simulated annealing, straight skeleton

Categories: G.2.2, I.3.5, I.6.3