File:8-points-no-pentagon.svg
Summary
| Description | A set of eight points in general position with no convex pentagon. According to a generalization of the Happy Ending problem, every nine points in general position have some five points forming a convex pentagon; this example shows that the number of points in this result cannot be reduced. |
| Date | 7 October 2006 (original upload date) |
| Source | Transferred from en.wikipedia to Commons. |
| Author | David Eppstein at English Wikipedia |
Licensing
 |
This work has been released into the public domain by its author, David Eppstein at English Wikipedia. This applies worldwide. In some countries this may not be legally possible; if so: David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
Original upload log
The original description page was here. All following user names refer to en.wikipedia.
- 2006-10-07 19:10 David Eppstein 360×360×8 (2817 bytes) A set of eight points in general position with no convex pentagon. According to a generalization of the [[Happy Ending problem]], every nine points in general position have some five points forming a convex pentagon; this example shows that the number of