Embedding Planar Graphs on the Grid

  title={Embedding Planar Graphs on the Grid},
  author={Walter Schnyder},
We show that each plane graph of order n 2 3 has a straight line embedding on the n-2 by n-2 grid. This embedding is computable in time O(n). A nice feature of the vertex-coordinates is that they have a purely combinatorial meaning. 
Highly Influential
This paper has highly influenced 60 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 410 extracted citations

Greedy Drawings of Triangulations

Discrete & Computational Geometry • 2008
View 14 Excerpts
Highly Influenced

New results on edge partitions of 1-plane graphs

Theor. Comput. Sci. • 2018
View 8 Excerpts
Highly Influenced

Non-aligned drawings of planar graphs

Graph Drawing • 2016
View 10 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…