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

interferenceintersectionsrectangular pathsupper boundVLSI layout

Mathematics Subject Classification ID

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

Review text

Let I(P,Q) be the number of intersections between two rectangular paths P and Q. \textit{K. Kant} [IEEE Trans. Comput. C-34, 1045-1049 (1985; Zbl 0572.68057)] shows that \[ I(P,Q)\leq \frac{10}{9}| P| | Q| +\frac{4}{9}(| P| +| Q|). \] Recently, Wang et al. improved the upper bound to \[ | P| | Q| +\frac{1}{2}\min \{| P|,| Q| \}+\frac{1}{3}\max \{| P|,| Q| \} \] and conjecture that the bound cao be further sharpened to \(| P| | Q| +2\) for \(2\leq \min \{| P|,| Q| \}.\) An upper bound on I(P,Q), where both P and Q restricted to be monotonic, is derived, the conjecture of \textit{Y. L. Wang}, \textit{R. C. T. Lee} and \textit{J. S. Chang} [The number of intersections between two rectangular paths, IEEE Trans. Comput. 38, 1564-1571 (1989)] is validated.

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

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

Cited in

(5)

• A tight upper bound for the number of intersections between two rectangulars paths
• The maximum number of intersections between two plane rectangular paths
• An almost optimal bound on the number of intersections of two simple polygons
• 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)