Review of Forbidden Configurations in Discrete Geometry by David Eppstein
Abstract
In 1930, the mathematician Esther Klein observed that any five points in the plane in general position (i.e., no three points forming a line) contain four points forming a convex quadrilateral. This innocentsounding discovery led to major lines of research in discrete geometry. Klein's friends Paul Erdős and George Szekeres generalized this theorem, and also conjectured that 2k-2 + 1 points (again in general position) would be enough to force a convex k-gon to exist. The resolution of this conjecture became known as the "happy ending problem," because Klein and Szekeres ended up getting married. The unhappy side is that it has, to date, not been completely solved, although a recent breakthrough of Suk made significant progress.
This both mathematically and personally charming little story is a great beginning for this elegant book about discrete geometry. It typifies the type of problems that are studied throughout, and also captures the spirit of curiosity that drives such studies. The book covers many problems that lie at the intersection of three fields: discrete geometry, algorithms and computational complexity.
Index Terms
- Review of Forbidden Configurations in Discrete Geometry by David Eppstein
Index terms have been assigned to the content through auto-classification.
Recommendations
Eppstein's bound on intersecting triangles revisited
Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in @W(m^3/(n^6log^2n)) triangles of T. Eppstein [D. Eppstein, Improved bounds for intersecting triangles and ...
Comments
Information & Contributors
Information
Published In
![cover image ACM SIGACT News](/cms/asset/9c302cce-370b-4a79-9572-444eba76743a/3444815.cover.jpg)
December 2020
104 pages
Copyright © 2021 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 January 2021
Published in SIGACT Volume 51, Issue 4
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 23Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in