Planar Drawings of Plane Graphs

@inproceedings{Nakano2000PlanarDO,
  title={Planar Drawings of Plane Graphs},
  author={Shin-Ichi Nakano},
  year={2000}
}
Given a plane graph G, we wish to nd 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 edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper rst we review known two methods to nd such drawings, then explain a hidden relation between… CONTINUE READING
12 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Tollis, \Automatic graph drawing: an annotated bibliography,

  • G. Di Battista, P. Eades, I.G.R. Tamassia
  • Computational Geometry: Theory and Applications,
  • 1994
1 Excerpt

Construction of Canonical Ordering and Convex Drawing of Triconnected Planar NAKANO: PLANAR DRAWINGS OF PLANE GRAPHS 9 Graphs,

  • X. He, M. Y. Kao, Parallel
  • Proc. of ISAAC'93, Lecture Notes in Computer…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…