Finding Interferences Between Rectangular Paths

DOI10.1109/TC.1985.1676537zbMATH Open0572.68057OpenAlexW2010763116MaRDI QIDQ3690239FDOQ3690239

Authors: Krishna Kant 

Publication date: 1985

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1985.1676537

Recommendations

• A tight upper bound for the number of intersections between two rectangulars paths
• An improved upper bound on the number of intersections between two rectangular paths
• The maximum number of intersections between two plane rectangular paths
• Finding Rectangle Intersections by Divide-and-Conquer
• Rectilinear shortest paths in the presence of rectangular barriers

zbMATH Keywords

routingbacktrackingoptimal algorithmintersectionsoverlaps

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited In (3)

• An improved upper bound on the number of intersections between two rectangular paths
• A tight upper bound for the number of intersections between two rectangulars paths
• The maximum number of intersections between two plane rectangular paths

This page was built for publication: Finding Interferences Between Rectangular Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690239)