|
|
A063544
|
|
Smallest number of triangulations of n points in the plane.
|
|
2
|
|
|
1, 1, 2, 4, 11, 30, 89, 250, 776, 2236, 7147, 20979, 68448
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,3
|
|
COMMENTS
|
In a so-called double circle, half of the points are extremal, and for every edge of the convex hull, there is one interior point that is arbitrarily close to it. The double circles are conjectured to minimize the number of triangulations, and in this case the next terms would be 203748, 674949, 2031054, 6807382, 20662980, ... - Manfred Scheucher, Aug 22 2016
|
|
REFERENCES
|
P. Brass, W. O. J. Moser, J. Pach, Research Problems in Discrete Geometry, Springer (2005).
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|