On counting triangulations in d dimensions

Given a set of n labeled points on S^d, how many combinatorially different geometric triangulations for this point set are there? We show that the logarithm of this number is at most some positive constant times n^d/2+1. Evidence is provided that for even dimensions d the bound can be improved to some constant times n^d/2.