Initialize a hashmap to store pairs of points with their center and diagonal length as keys.
Iterate over all pairs of points:
a. Calculate the center point and the squared length of the diagonal.
b. Store the pair in the hashmap using the center and length as keys.
Iterate over the hashmap entries:
a. For each entry with more than one pair, iterate over all combinations of pairs.
b. If the pairs have the same diagonal length, calculate the area of the rectangle.
c. Update the minimum area if the calculated area is smaller.
Return the minimum area found, or 0 if no rectangle can be formed.