Given a plane graph G, we wish to find a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edgc--intersection. Such drawings are called planar straight--line drawings of G. All additional objective is to minimize the area of the rectangular grid in which G is drawn. 1n this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.
展开▼
