The author presents a survey of results on layouts of graphs on rectangular lattices, published no later than in 1982. Various aspects of the problem are discussed (e.g. the minimum area occupied by the layout, the maximum edge-length in a layout, the relation between separator theorems and rectangular lattice layouts, etc.).