Happy Ending problem

The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.