An Algorithm for Path Connections and Its Applications

@article{Lee1961AnAF,
  title={An Algorithm for Path Connections and Its Applications},
  author={C. Y. Lee},
  journal={IRE Trans. Electron. Comput.},
  year={1961},
  volume={10},
  pages={346-365}
}
  • C. Y. Lee
  • Published 1 September 1961
  • Computer Science, Mathematics
  • IRE Trans. Electron. Comput.
The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding? The results are highly encouraging. Within our framework, we are able to solve the following types of problems: 1) To find a path between two points so that it crosses the least number of existing paths. 2) To… 
View via Publisher
janders.eecg.toronto.edu
1,476 Citations
Highly Influential Citations
45
Background Citations
208
Methods Citations
313

1,476 Citations

Citation Type

Citation Type

A 4-geometry maze router and its application on multiterminal nets
TLDR
To solve the obstacle-avoiding rectilinear and 4-geometry Steiner tree problems, a heuristic algorithm is presented that utilizes a cost accumulation scheme based on the maze router to determine the Torricelli vertices (points) for improving the quality of multiterminal nets.
A maze running router and its wirability for single‐layer printed wiring boards
TLDR
A new maze running-type algorithm is presented which gives near-shortest path routes, and its wirability is compared with other existing maze methods to check the appropriateness of the shortest path selection policy.
Finding obstacle-avoiding shortest paths using implicit connection graphs
We introduce a framework for a class of algorithms solving shortest path related problems, such as the one-to-one shortest path problem, the one-to-many shortest paths problem and the minimum…
An algorithm for minimizing backboard wiring functions
TLDR
A partially exhaustive algorithm is presented for solving the following problem arising from automatic layout of a computer, similar to the Downhill Method for finding the minimum of a real function F(P), and can be applied to other placement problems.
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
A solution to line routing problems on the continuous plane
TLDR
A new linerouting algorithm based on the continuous plane, which is much faster than the conventional method and has given good results when applied to many mazes, printed circuit boards, substrates, and PERT diagrams.
A probabilistic model for the analysis of the routing process for circuits
TLDR
It is shown that the routing probability, RM(d), is bounded above by PM( d), where PM(d) is the probability of existence of an arbitrary path of ideal Manhattan distance d from a given source point.
Permutation procedure for minimising the number of crossings in a network
The paper describes a method for laying out networks by computer so that the number of crossings between the network connections is close to a minimum. The problem is relevant to the design of…
An algorithm for connectingN points with a minimum number of crossings
TLDR
This article extends a simplified algorithm for connecting two points with a path optimal with reference to given functions to then-terminal case and assumes the simplified form presented in «SIMPLIFICATION of LEE'S ALGORITHM for special problems» by E.C. Majorani.
A Rectilinear Shortest-path Routing Algorithm for a Two Dimensional Grid
TLDR
This paper presents a rectilinear shortest-path routing algorithm for a two dimensional grid that is extracting a smaller, path preserving graph (ACG) from the grid to assist path calculation.
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Maximal Flow Through a Network
Introduction. The problem discussed in this paper was formulated by T. Harris as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of…
Shortest connection networks and some generalizations
The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links. Simple and practical procedures are given for solving this problem…