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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

What is the maximum number of intersections of the boundaries of a simple m-gon and a simple n-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of m and n is even. If both m and n are odd, the best known construction has mn − (m + n) + 3 intersections, and it is conjectured that this is the maximum. However, the best known upper bound is only mn − (m + dn6 e), for m ≥ n. We prove a new upper bound of mn − (m + n) + C for some constant C, which is optimal apart from the value of C.

Original languageEnglish
Title of host publication36th International Symposium on Computational Geometry, SoCG 2020
EditorsSergio Cabello, Danny Z. Chen
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771436
DOIs
StatePublished - 1 Jun 2020
Event36th International Symposium on Computational Geometry, SoCG 2020 - Zurich, Switzerland
Duration: 23 Jun 202026 Jun 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume164
ISSN (Print)1868-8969

Conference

Conference36th International Symposium on Computational Geometry, SoCG 2020
Country/TerritorySwitzerland
CityZurich
Period23/06/2026/06/20

Bibliographical note

Publisher Copyright:
© Eyal Ackerman, Balázs Keszegh, and Günter Rote; licensed under Creative Commons License CC-BY 36th International Symposium on Computational Geometry (SoCG 2020).

Keywords

  • Combinatorial geometry
  • Ramsey theory
  • Simple polygon

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'An almost optimal bound on the number of intersections of two simple polygons'. Together they form a unique fingerprint.

Cite this