Inscribable stacked polytopes
  We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations. 
Bernd Gonska and G\"unter M. Ziegler
math.MG math.CO math.NA