DocumentCode
1151345
Title
Finding Interferences Between Rectangular Paths
Author
Kant, Krishna
Author_Institution
Department of Computer Science, Pennsylvania State University
Issue
11
fYear
1985
Firstpage
1045
Lastpage
1049
Abstract
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.
Keywords
Backtrack; intersection; overlap; rectangular paths; routing; Computer science; Counting circuits; Interference; Printed circuits; Routing; Upper bound; Very large scale integration; Wires; Backtrack; intersection; overlap; rectangular paths; routing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1985.1676537
Filename
1676537
Link To Document