Minimum Area Rectangle

Given up to 500 unique 2D points, find the smallest area of an axis-aligned rectangle whose four corners are among the points. The core challenge is efficiently detecting matching opposite sides/opposite corners (e.g., by hashing points or tracking previously seen y-pairs between x-columns) to avoid checking all quadruples.