The Number of Intersections Between two Rectangular Paths

Authors:
Y.-L. Wang;R. C. Lee;J. S. Chang
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 5
Cited 0

Finding Interferences Between Rectangular Paths

IEEE Transactions on Computers
Reporting and counting segment intersections

Journal of Computer and System Sciences
Plane-sweep algorithms for intersecting geometric figures

Communications of the ACM
Optimal wiring between rectangles

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI

Computational Aspects of VLSI

Quantified Score

Hi-index	14.98

Visualization

Abstract

The authors consider upper bounds on the number of intersections between two rectangular paths. Let these two paths be denoted as P and Q, and denote the number of Manhattan subpaths in P and Q by mod P mod and mod Q mod respectively. K. Kant (1985) gave an upper bound of 10 mod P mod mod Q mod /9+4( mod P mod + mod Q mod )/9. The authors have sharpened these upper bounds, using methods to break the rectangular paths into subpaths, to be mod P mod mod Q mod +( mod P mod /2)+( mod Q mod /3), where they assume without loss of generality that mod P mod or= mod Q mod.