An improved upper bound on the number of intersections between two rectangular paths
From MaRDI portal
Publication:758223
DOI10.1016/0020-0190(91)90146-9zbMATH Open0724.68093OpenAlexW2070379127MaRDI QIDQ758223FDOQ758223
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
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.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Algorithms for Reporting and Counting Geometric Intersections
- Plane-sweep algorithms for intersecting geometric figures
- Comments on “algorithms for reporting and counting geometric intersections”
- Reporting and counting segment intersections
- Title not available (Why is that?)
- Finding Interferences Between Rectangular Paths
- The number of intersections between two rectangular paths
Cited In (5)
- Finding Interferences Between 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
- The maximum number of intersections between two plane 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)
