论文信息 - DRAWING FREE TREES ON 2D GRIDS WHICH ARE BOUNDED BY SIMPLE POLYGONS

DRAWING FREE TREES ON 2D GRIDS WHICH ARE BOUNDED BY SIMPLE POLYGONS

In this paper, a polyline grid drawing of free trees on two dimensional grids, bounded by simple polygons, is investigated. To the authors' knowledge, this is the first attempt made to develop algorithms for drawing graphs on two dimensional grids bounded by simple polygons.

Alireza Bagheri | M Raziee

[1] Stefan Felsner,et al. Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..

[2] Franz Aurenhammer,et al. A Novel Type of Skeleton for Polygons , 1996 .

[3] Francis Y. L. Chin,et al. Finding the Medial Axis of a Simple Polygon in Linear Time , 1995, ISAAC.

[4] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[5] Frank Wagner,et al. The VLSI layout in various embedding models , 1990, WG.

[6] David Harel,et al. Drawing graphs nicely using simulated annealing , 1996, TOGS.

[7] Petr Felkel,et al. Straight Skeleton Implementation , 1998 .

[8] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9] Alireza Bagheri,et al. How to draw free trees inside bounded rectilinear polygons , 2004, Int. J. Comput. Math..

[10] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.