The main objective of this project is to implement the data structures which store a set of n weighted points in a plane, and allows queries for the closest pair of points within a square query range with the same time complexity as described in the paper Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares by Kazi and Smid.