How to make a triangulation of polytopal

We introduce a numerical isomorphism invariant for any triangulation of . Although its definition is purely topological (inspired by the bridge number of knots), reflects the geometric properties of . Specifically, if is polytopal or shellable, then is ``small' in the sense that we obtain a linear upper bound for in the number of tetrahedra of . Conversely, if is ``small', then is ``almost' polytopal, since we show how to transform into a polytopal triangulation by local subdivisions. The minimal number of local subdivisions needed to transform into a polytopal triangulation is at least . Using our previous results The size of triangulations supporting a given link, Geometry & Topology 5 (2001), 369-398], we obtain a general upper bound for exponential in . We prove here by explicit constructions that there is no general subexponential upper bound for in . Thus, we obtain triangulations that are ``very far' from being polytopal. Our results yield a recognition algorithm for that is conceptually simpler, although somewhat slower, than the famous Rubinstein-Thompson algorithm.