Back to Results
First PageMeta Content
Convex analysis / Convex geometry / Euclidean plane geometry / Discrete geometry / Computational geometry / Convex hull / Convex set / Sylvester–Gallai theorem / Convex function / Geometry / Mathematics / Mathematical optimization


CCCG 2009, Vancouver, BC, August 17–19, 2009 Every Large Point Set contains Many Collinear Points or an Empty Pentagon Zachary Abel∗ Ferran Hurtadok
Add to Reading List

Document Date: 2009-09-02 14:32:39

Open Document

File Size: 199,83 KB

Share Result on Facebook

City

Davis / Bruxelles / Vancouver / Catalunya / /

Company

Ge / /

Country

Belgium / Canada / Australia / Spain / /

/

Facility

Bellairs Research Institute / Carleton University / The University of Melbourne / Western Kentucky University / Harvard University / /

Organization

University of Melbourne / Pentagon / Harvard University / Bellairs Research Institute in Barbados / Cambridge Univ. / Department of Mathematics / School of Computer Science / Western Kentucky University / Davis School for Independent Study / Universitat Polit` / Carleton University / /

Person

Peter Braß / Joseph D. Horton / Scott D. Kominers∗∗ Stefan / George Szekeres / Attila Po / Jos Coelho de Pina / David R. Wood / Pura Appl / Ai / Cristina Fernan / Brad Ballinger / Erik Demaine / Godfried Toussaint / Carlos M. Nicola / Heiko Harborth / Attila Po David / Paul Erdo / Brad Ballinger† Prosenjit Bose / Tobias Gerken / David Eppstein / Ferran Hurtado / Ferran Hurtadok Brad Ballinger / Pavel Valtr / Yoshiharu Kohayakawa / Scott D. Kominmovic / Vida Dujjit Bose / William O. J. Moser / Stefan Langerman / Zachary Abel / Yoshiko Wakabayashi / /

ProgrammingLanguage

K / D / /

ProvinceOrState

Kentucky / British Columbia / California / Massachusetts / /

Region

Western Kentucky / /

URL

http /

SocialTag