1 citations · 1 across the 1 of their papers we have counts for
1 paper
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations…