Note on the number of triangulations of planar point sets (Q1288910): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/pl00009823 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089078292 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the number of triangulations of planar point sets |
scientific article |
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
