Given points in Euclidean space, is there a fast algorithm to count the number of points 'under' one arbitrary hyperplane? Fast means time complexity lower than O(n)

Time for preprocessing or sorting the points is okay

And, even if not high dimensional, I'd like to know whether there exists one that can be used in 2 dimension space