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

2006 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    2
    Citations
    NaN
    KQI
    []