On Intersecting Polygons

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 $$\left\lfloor \frac{m}{2}\right\rfloor \cdot \left\lfl...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Williams, Kada
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!