Finding Interferences Between Rectangular Paths
Kant · IEEE Transactions on Computers · 1985
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.