LeoGrin/Approximation-algorithms-for-geometric-problems

Using the concept of Well Separated Pair Decomposition, we can efficiently compute various geometry algorithm, from closest-pairs to force-directed graph layout.

Java