12 research outputs found
16th Scandinavian Symposium and Workshops on Algorithm Theory: SWAT 2018, June 18-20, 2018, Malmö University, Malmö, Sweden
Get PDF27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany
Get PDFLIPIcs, Volume 248, ISAAC 2022, Complete Volume
Get PDFLIPIcs, Volume 248, ISAAC 2022, Complete Volum
36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany
Get PDF
43rd International Symposium on Mathematical Foundations of Computer Science: MFCS 2018, August 27-31, 2018, Liverpool, United Kingdom
Get PDFLIPIcs, Volume 261, ICALP 2023, Complete Volume
Get PDFLIPIcs, Volume 261, ICALP 2023, Complete Volum
Large bichromatic point sets admit empty monochromatic 4-gons
No full textWe 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 position in the plane has a subset of k points
that are the vertices of a convex k-gon. In our setting
the points of S are colored, and we say that a (not necessarily
convex) spanned polygon is monochromatic if
all its vertices have the same color. Moreover, a polygon
is called empty if it does not contain any points of
S in its interior. We show that any bichromatic set of
n ≥ 5044 points in R2 in general position determines
at least one empty, monochromatic quadrilateral (and
thus linearly many).Postprint (published version
Collection of abstracts of the 24th European Workshop on Computational Geometry
Get PDFInternational audienceThe 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three invited talks presented at the workshop
