References
- Graham , R. L. (1972) . An efficient algorithm for determining the convex hull of a finite planar set . Information Processing Letters , 1 ( 4 ) : 132 – 133 .
- Preparata F. P. Shamos M. I. (1985) Computational geometry Texts and Monographs in Computer Science Springer-Verlag
- Seidel R. (1997) Convex hull computations In: J. E. Goodman and J. O'Rourke (Eds.) Handbook of Discrete and Computational Geometry CRC Press pp. 361–376
- Motzkin T. S. Raiffa H. Thompson G. L. Thrall R. M. (1953) The double description method In: Contributions to the Theory of Games Number 28 in Annals of Mathematics Study Princeton University Press
- Chernikova , N. V. (1968) . Algorithm for discovering the set of all solutions of a linear programming problem . USSR Computational Mathematics Mathematical Physics , 8 ( 6 ) : 282 – 293 .
- Avis , D. and Fukuda , K. (1992) . A pivoting algorithm for convex hulls vertex enumeration of arrangements polyhedra . Discrete Computational Geometry , 8 : 295 – 313 .
- Le Verge H. (1992) A note on Chernikova's algorithm Technical Report 1662 Institut de Recherche en Informatique, Campus Universitaire de Beaulieu France
- Sedgewick R. (1988) Algorithms Addison-Wesley
- Anderson , K. R. (1978) . A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set . Information Processing Letters , 7 ( 1 ) : 53 – 55 .
- Ziegler G. (1994) Lectures on polytopes Graduate Texts in Mathematics 152 Springer-Verlag
- Klee , V. L. (1959) . Some characterizations of convex polyhedra . Acta Mathematica , 102 : 79 – 107 .