Store all points in a hash set.
For each pair of points and where and (potential diagonal corners):
Check if and are in the set.
If yes, compute area and update minimum.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Check all diagonal pairs
Store all points in a hash set.
For each pair of points and where and (potential diagonal corners):
Check if and are in the set.
If yes, compute area and update minimum.