Qhull Convex Hull Wants Me To Input At Least 3 Points

Update: I've decided to try to use a linear programming package in order to determine if the vertices of the two polytopes are linearly separable. (The vertices are really my data

Solution 1:

QHull doesn't really have to handle the polytopes of one or two vertices (or d-1 vertices in dimension d) as they are perforce their own convex hulls (and they are simplices).

Check for a low number and transfer the input to the output.