Vertex enumeration problem: Difference between revisions

Revision as of 21:02, 1 October 2008

Revision as of 18:11, 2 October 2008

Line 1:

The '''vertex enumeration problem''' for a [[polyhedron]], a polyhedral [[cell complex]], a [[hyperplane arrangement]], or some other object of [[discrete geometry]], is the problem of determination of the object's [[vertex (geometry)|vertices]] given some formal representation of the object. A classical example is the problem of enumeration of the vertices of a [[convex polyhedron]] specified by thea [[set of linear inequalities]]:<ref>[[Eric W. Weisstein]] ''CRC Concise Encyclopedia of Mathematic,'' 2002,ISBN 1584883472, p. 3154, article "vertex enumeration"</ref>

:<math>Ax \leq b</math>