A planar graph drawing program

This paper describes a program, written in FORTRAN, for a 64K I.C.L. 4130 which will accept data describing the ordering of nodes and branches within the regions of a planar graph, and generate a two‐dimensional representation, without crossovers, from these data.

Abstract

Abstract This paper describes a program, written in FORTRAN, for a 64K I.C.L. 4130 which will accept data describing the ordering of nodes and branches within the regions of a planar graph, and generate a two‐dimensional representation, without crossovers, from these data. The program was written to provide one of the basic ‘tools’ required in the development of a printed wiring board layout program for the electronics industry The program generates display code which is sent to a satellite PDP‐7 computer driving a 340 display. On completion of the automatic drawing phase an interactive phase is entered in which the user can ‘tidy’ and label the drawing, by means of keyboard and light‐pen commands Brief notes are included on the hardware, the data structures package (MINIJASP, derived from ASP) and the graphics package, employed.