Skip to main content
Source Link

A method to find the number of points contained inside the rectangle in O(log n ^2 ) worst case with precomputation?

Given a set of 2 - D points (with integer x and integer y coordinates) and a set of queries containing the coordinates of a rectangle(integers).