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

DOI10.1016/0020-0190(91)90146-9MaRDI QIDQ758223zbMATH OpenOpenAlexFDO

Authors 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

interferenceupper boundintersectionsVLSI layoutrectangular paths

Mathematics Subject Classification ID

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

Recommendations

• A tight upper bound for the number of intersections between two rectangulars paths
• The maximum number of intersections between two plane rectangular paths
• Finding Interferences Between Rectangular Paths
• An almost optimal bound on the number of intersections of two simple polygons
• On the number of intersections of two polygons.

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• Algorithms for Reporting and Counting Geometric Intersections
• Comments on “algorithms for reporting and counting geometric intersections”
• Finding Interferences Between Rectangular Paths
• Plane-sweep algorithms for intersecting geometric figures
• Reporting and counting segment intersections
• The number of intersections between two rectangular paths

Cited in

(5)

• The maximum number of intersections between two plane rectangular paths
• An almost optimal bound on the number of intersections of two simple polygons
• A tight upper bound for the number of intersections between two rectangulars paths
• Finding Interferences Between Rectangular Paths
• On the number of intersections of two polygons.

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

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