An efficient algorithm for enumeration of triangulations (Q1862130): Difference between revisions
From MaRDI portal
Latest revision as of 12:32, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for enumeration of triangulations |
scientific article |
Statements
An efficient algorithm for enumeration of triangulations (English)
0 references
10 March 2003
0 references
The paper is concerned with the problem of enumerating triangulations of \(n\) points in the plane. An efficient algorithm is presented to do this in \(O(\log(\log n))\) time per triangulation.
0 references
triangulations
0 references
enumeration
0 references
reverse search
0 references
algorithm
0 references
