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: how far they are (if they are separable) ?

Brief sketch of the algorithm

on-line version

required operations