Note on the number of triangulations of planar point sets (Q1288910)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on the number of triangulations of planar point sets |
scientific article; zbMATH DE number 1288341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the number of triangulations of planar point sets |
scientific article; zbMATH DE number 1288341 |
Statements
Note on the number of triangulations of planar point sets (English)
0 references
18 May 1999
0 references
\(n\) points in the plane determine a triangulation (a maximal subset of straight line segments without intersections except possibly at end points). Using ideas about encoding triangulations in a binary string, an upper bound is given for the maximum number \(g(n)\) of different triangulations.
0 references
triangulations
0 references
planar point sets
0 references
