1. D. Avis, D. Bremner and R. Seidel. How good are convex hull algorithms. Computational Geometry: Theory and Applications (to appear).
2. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom., 8:295–313, 1992.
3. D. Avis. A C implementation of the reverse search vertex enumeration algorithm. School of Computer Science, McGill University, Montreal, Canada, 1993. programs lrs and qrs available via anonymous ftp from mutt.cs.mcgill.ca (directory pub/C).
4. C.B. Barber, D.P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. Technical Report GCC53, The Geometry Center, Minnesota, U.S.A., 1993.
5. G. Ceder, G.D. Garbulsky, D. Avis, and K. Fukuda. Ground states of a ternary fcc lattice model with nearest and next-nearest neighbor interactions. Physical Review B, 49(1):1–7, 1994.