|
|||||
|
|
An efficient algorithm for enumeration of triangulations |
|
| Authors: | Sergei Bespamyatnikh |
| Affiliation: | Department of Computer Science, University of British Columbia, 201-2366 Main Mall, Vancouver, BC, V6T 1Z4, Canada |
| Abstract: | We consider the problem of enumerating triangulations of n points in the plane in general position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in O(loglogn) time per triangulation. It improves the previous bound by almost linear factor. |
| Keywords: | Triangulations Enumeration Reverse search |
| 本文献已被 ScienceDirect 等数据库收录！ | |