Hello, I recently started studying algorithms in computational geometry, I seem to have problems with the following computational geometry problem, I have searched long and hard but still cant find a solution: it goes: given n points, find the triplicate whose angle is close to 90 as possible. any suggestions will be appreciated.
Maximal N is ?
MAX N = 100000
An algorithm may work for n ≤ 1000, algorithm. define S as the set contains n given point.
After some searching, I found a similar question here