This paper discusses a new line-routing algorithm. The algorithm has been programmed in FORTRAN II for the IBM 7094 and in FORTRAN IV for the IBM 360/65. It has given good results when applied to many line-routing problems such as mazes, printed circuit boards, substrates, and PERT diagrams. The main advantages of this algorithm, which is based on the continuous plane, over conventional algorithms based on the discrete plane are twofold:
No takes yet. Share an insight, caveat, or question.
David W. Hightower (1969) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: