On the Covering Multiplicity of k-Heavy Simplices

This paper generalizes Delaunay triangulations by proving that for a generic point set in d-dimensional space, every generic point belongs to a fixed number of simplices whose circumspheres enclose exactly k points, and this number, called the k-th covering number, is equal to the binomial coefficient (d+k choose d).