This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Finding Interferences Between Rectangular Paths
November 1985 (vol. 34 no. 11)
pp. 1045-1049
K. Kant, Department of Computer Science, Pennsylvania State University
The paper examines the problem of counting all interferences between a set of rectangular paths. Tight upper bounds on the number of overlaps and intersections between two or more rectangular paths are derived both for the general case and the special cases where the backtracking is not allowed in one or both directions. An optimal algorithm for counting all interferences for both the special and general cases is presented.
Index Terms:
routing, Backtrack, intersection, overlap, rectangular paths
Citation:
K. Kant, "Finding Interferences Between Rectangular Paths," IEEE Transactions on Computers, vol. 34, no. 11, pp. 1045-1049, Nov. 1985, doi:10.1109/TC.1985.1676537
Usage of this product signifies your acceptance of the Terms of Use.