On-line and off-line vertex enumeration by adjacency lists

The authors propose a new algorithm to solve the on-line vertex enumeration probelm for polytopes, doing all computations in n-space, where n is the dimension of the polytope. This algorithm exploits adjacency lists between vertices and uses no simplex tableaux. It can handle the cases of empty or degenerate polyhedra. A theoretical and numerical comparison with existing approaches for off-line vertex enumeration is presented.