H-representation and V-representation

Summary

A convex polytope can be described in two ways. A V-representation lists finitely many points whose convex hull is the polytope. An H-representation lists finitely many linear inequalities, that is closed half-spaces, whose common solutions form the polytope. Every convex polytope has both, and computations with polytopes, as in linear programming and computational geometry, depend on which one is at hand.