A characterization is given of
simplicial polytopes that are barycentric subdivisions of regular CW spheres. It is
shown that barycentric subdivisions of connected polyhedral complexes with at least
two facets determine the underlying complex uniquely up to duality. Connections
with the algorithmic theory of comparability graphs are discussed. The f-vectors of
regular CW spheres are characterized.