GJK implementation

Basic use cases

Given two sets of points in nd (possibly lifted from a 2d space):

1. separation problem: are they linearly separable ?
2. distance problem: they are separable, but how far they are from each other ?

Brief sketch of the algorithm

on-line version

required operations