  In this article, we study the complexity involved in the computation of the
reach in arbitrary dimension and in particular the computation of the critical
spherical curvature points of an arbitrary algebraic variety. We present
properties of the critical spherical curvature points as well as an algorithm
for computing it.
