Sciweavers

3 search results - page 1 / 1
» Every Large Point Set contains Many Collinear Points or an E...
Sort
View
CCCG
2009
13 years 5 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 3 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
SIGACT
2008
103views more  SIGACT 2008»
13 years 4 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke