1
Matheiss T H, Rubin D S. A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets[J]. Mathematics of Operations Research, 1980, 5(2): 167-185.
2
Avis D, Bremner D, Seidel R, et al. How good are convex hull algorithms[J]. Computational Geometry: Theory and Applications, 1997: 265-301.
3
Billera L J, Lee C W. A proof of the sufficiency of McMullen\u0027s conditions for f-vectors of simplicial convex polytopes[J]. Journal of Combinatorial Theory, 1981, 31(3): 237-255.
4
Dyer M. The Complexity of Vertex Enumeration Methods[J]. Mathematics of Operations Research, 1983, 8(3): 381-402.
5
Swart G. Finding the convex hull facet by facet[J]. Journal of Algorithms, 1985, 6(1): 17-48.
6
Shamir R. The Efficiency of the Simplex Method: A Survey[J]. Management Science, 1987, 33(3): 301-334.
7
Gil Kalai. Rigidity and the lower bound theorem 1. 1987.
8
Klee, Victor. On the Complexity of d-Dimensional Voronoi Diagrams.[J]. Archiv der Mathematik, 1979.
9
Danaraj G, Klee V. Which Spheres are Shellable[J]. Discrete Mathematics, 1978: 33-52.
10
Bayer M M, Lee C W. CHAPTER 2.3 - Combinatorial Aspects of Convex Polytopes[C]., 1993: 485-534.