From Wikipedia, the free encyclopedia

| 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.
|
| Source |
Originally from en.wikipedia; description page is/was here.
|
| Date |
2006-10-07 (original upload date)
|
| Author |
Original uploader was David Eppstein at en.wikipedia
|
Permission
(Reusing this image) |
Released into the public domain (by the author).
|
[edit] License information
 |
This image has been (or is hereby) released into the public domain by its author, David Eppstein at the wikipedia project. This applies worldwide.
In case this is not legally possible:
David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
|
[edit] Original upload log
(All 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
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment |
| current | 06:32, 24 August 2007 | 360×360 (956 B) | David Eppstein | |
File links
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):