Boundary smoothing algorithm imprevement.

The smoothing algorithm works by averaging neighbouring points. The number of neighbouring points to consider are specified by the 'degree' of smoothing. Close to the array boundaries, where 'degree' number of neighbours are not available, the array is truncated and no smoothing is performed. Given these boundaries are circular, the smoothing algorithm should be modified such that it correctly smooths array elements at the start and end of the array, by considering elements on the other end of the array.