How do I compute the intersection of halfspaces with Qhull?
Qhull computes the halfspace intersection about a point. The point must be inside all of the halfspaces. Given a point, a duality turns a halfspace intersection problem into a convex hull problem. Use linear programming if you do not know a point in the interior of the halfspaces. See the manual. You will need a linear programming code. This may require a fair amount of work to implement.