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

DOI10.4230/lipics.socg.2020.1OpenAlexW3037453711MaRDI QIDQ6059944

Balázs Keszegh, Eyal Ackerman, 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

Ramsey theorycombinatorial geometrysimple polygon

Mathematics Subject Classification ID

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

Related Items (1)

An almost optimal bound on the number of intersections of two simple polygons

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