On Intersecting Polygons

MaRDI QIDQ6430210zbMATH OpenFDO

Authors Kada Williams

Publication date 20 March 2023

Abstract: Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the bounds ${\displaystyle }$leftlfloor frac{m}{2} ight floor cdot leftlfloor frac{n}{2} ight floorle f(n,m)le leftlfloor frac{m}{2} ight floor cdot frac{n}{2} + frac{m}{2} ${\displaystyle }$ where $f(n,m)$ denotes the maximal number of components and $mlen$. Furthermore, we give an exact answer to the related question of finding the maximal number of components if the $m$-gon is required to be convex: $leftlfloorfracm+n-22ightfloor$ if $ngem+2$ and $n-2$ otherwise.

This page was built for publication: On Intersecting Polygons

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