linear separability test.

[Simon Kasif <kasif@crabcake.cs.jhu.edu>]

Algorithms for convex hull construction in multiple dimensions
are usually exponential in the number of dimensions.
Thus, at least asymptotically one may prefer linear programming methods.
Many interesting special cases to decide whether
convex polytopes intersect and consequently determine 
linear separability (e.g., in 2 or 3 dimensions) are discussed
in standard computational geometry books (e.g., Preparata and Shamos).