| |
| | Citations: Algorithms for automatic graph drawing: an annotated bibliography - Eades, Tamassia (ResearchIndex) (Site not responding. Last check: 2007-10-09) |
 | | ....graph is a drawing where the vertices are located at distinct grid points, and the edges are represented by straight line segments. |
 | | The upward drawing convention for drawing acyclic directed graphs has received a great deal of attention since last decade; and a number of results for drawing upward planar graphs have been published [2, 4, 6, 11] 1 Consider [7, 8, 9, 19] that.... |
 | | In this paper we consider planar orthogonal grid drawings, or, simply layouts, which are planar drawings such that the edges are polygonal chains consisting of horizontal and vertical segments, and the vertices and bends of the edges have integer coordinates. |
| citeseer.ist.psu.edu /context/65114/0 (2729 words) |
|