An efficient algorithm for enumeration of triangulations (Q1862130)
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: An efficient algorithm for enumeration of triangulations |
scientific article; zbMATH DE number 1879161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for enumeration of triangulations |
scientific article; zbMATH DE number 1879161 |
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
