An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.

DOI10.4230/LIPICS.SOCG.2020.1MaRDI QIDQ6059944zbMATH OpenOpenAlexFDO

Authors Eyal Ackerman, Balázs Keszegh, Günter Rote

Publication date 2 November 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/12159/pdf/LIPIcs-SoCG-2020-1.pdf/

zbMATH Keywords

combinatorial geometryRamsey theorysimple polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An almost optimal bound on the number of intersections of two simple polygons
• On the number of intersections of two polygons.
• scientific article; zbMATH DE number 1234822
• A tight upper bound for the number of intersections between two rectangulars paths

Cited in

(4)

• An almost optimal bound on the number of intersections of two simple polygons
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• scientific article; zbMATH DE number 942686 (Why is no real title available?)
• scientific article; zbMATH DE number 7539874 (Why is no real title available?)

This page was built for publication: An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.

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