An improved upper bound on the number of intersections between two rectangular paths

DOI10.1016/0020-0190(91)90146-9zbMath0724.68093OpenAlexW2070379127MaRDI QIDQ758223

Kim-Heng Teo, Tai-Ching Tuan

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90146-9

zbMATH Keywords

upper boundinterferenceintersectionsVLSI layoutrectangular paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

The maximum number of intersections between two plane rectangular paths ⋮ A tight upper bound for the number of intersections between two rectangulars paths

Cites Work

• Unnamed Item
• Reporting and counting segment intersections
• Algorithms for Reporting and Counting Geometric Intersections
• Finding Interferences Between Rectangular Paths
• Comments on “algorithms for reporting and counting geometric intersections”
• Plane-sweep algorithms for intersecting geometric figures
• The number of intersections between two rectangular paths

This page was built for publication: An improved upper bound on the number of intersections between two rectangular paths