Parallelization of neighborhood point deletion

I am implementing the Good Features To Track/Shi-Tomasi corner detection algorithm on CUDA and need to find a way to parallelize the following part of the algorithm:

1. I start with an array of points obtained from an image sorted according to a certain intensity value (an eigenvalue of a previous calculation).
2. Starting with the first point of the array, I remov开发者_如何学运维e any point in the array that is within a certain physical distance of the first point. (This distance is calculated on the image plane, not on the array).
3. On the resulting array, we repeat step two for the remaining points.

Is this somehow parallelizable, specifically on CUDA? I'm suspecting not, since there will obviously be dependencies across the image.

I think the article Accelerated Corner-Detector Algorithms describes the way to solve this problem.