  An algorithm is presented to compute isolated values of the divisor summatory
function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary
and uses a geometric approach of successive approximation combined with
coordinate transformation.
