tlooto
Sign up
Computer ScienceMathematics

An efficient algorithm for enumeration of triangulations

Sergei N. Bespamyatnikh

2002.11.1COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS

DOI: 10.1016/s0925-7721(02)00111-6

tlooto Summary

An algorithm for enumerating triangulations of n points in the plane in general position in O(loglog n) time per triangulation is presented and improves the previous bound by almost linear factor.

Abstract

Abstract is not available.

Citation format

BESPAMYATNIKH, Sergei N. An efficient algorithm for enumeration of triangulations. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 23: 271–279.