DeepAI

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

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 even, then every pair of sides may cross and so the answer is mn. If exactly one polygon, say the n-gon, has an odd number of sides, it can intersect each side of the m-gon at most n-1 times; hence there are at most mn-m intersections. It is not hard to construct examples that meet these bounds. 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 + ⌈n/6⌉), 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.

06/02/2021

### Improved Spanning on Theta-5

We show an upper bound of sin(3π/10) /sin(2π/5)-sin(3π/10) <5.70 ...
03/17/2019

### On the Complexity of the k-Level in Arrangements of Pseudoplanes

A classical open problem in combinatorial geometry is to obtain tight as...
12/17/2018

### Shifted varieties and discrete neighborhoods around varieties

For an affine variety X defined over a finite prime field F_p and some i...
11/02/2020

### At most 4.47^n stable matchings

We improve the upper bound for the maximum possible number of stable mat...
02/13/2023

### General Position Problem of Butterfly Networks

A general position set S is a set S of vertices in G(V,E) such that no t...
10/06/2019

### Clustering case statements for indirect branch predictors

We present an O(nlogn) algorithm to compile a switch statement into jump...
06/18/2020

### New Bounds for the Vertices of the Integer Hull

The vertices of the integer hull are the integral equivalent to the well...