Bibliography

1

N. Amenta.
Directory of computational geometry.
http://www.geom.uiuc.edu/software/cglist/.

2

D. Avis.
User's Guide for lrs - Version 3.2, 1997.
available from lrs homepage http://cgm.cs.mcgill.ca/~avis/C/lrs.html.

3

D. Avis, D. Bremner, and R. Seidel.
How good are convex hull algorithms.
Computational Geometry: Theory and Applications, 7:265-302, 1997.

4

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.

5

C.B. Barber, D.P. Dobkin, and H. Huhdanpaa.
qhull, Version 2003.1, 2003.
program and report available from http://www.qhull.org/.

6

D. Bremner, K. Fukuda, and A. Marzetta.
Primal-dual methods for vertex and facet enumeration.
In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 49-56, 1997.

7

T. Christof and A. Löbel.
PORTA: Polyhedron representation transformation algorithm (ver. 1.3.1), 1997.
http://www.zib.de/Optimization/Software/Porta/.

8

H. Edelsbrunner.
Algorithms in Combinatorial Geometry.
Springer-Verlag, 1987.

9

J. Erickson.
Computational geometry pages, list of software libraries and codes.
http://compgeom.cs.uiuc.edu/~jeffe/compgeom/.

10

R. Fourer and J.W. Gregory.
Linear programming frequently asked questions (LP-FAQ).
http://www-unix.mcs.anl.gov/otc/Guide/faq/linear-programming-faq.html.

11

K. Fukuda.
Polyhedral computation FAQ, 1998.
Both html and ps versions available from http://www.ifor.math.ethz.ch/~fukuda/fukuda.html.

12

K. Fukuda and A. Prodon.
Double description method revisited.
In M. Deza, R. Euler, and I. Manoussakis, editors, Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 91-111. Springer-Verlag, 1996.
ps file available from ftp://ftp.ifor.math.ethz.ch/pub/fukuda/reports/ddrev960315.ps.gz.

13

A. Marzetta.
pd - C-implementation of the primal-dual algoirithm, 1997.
code available from http://www.cs.unb.ca/profs/bremner/pd/.

14

T.S. Motzkin, H. Raiffa, GL. Thompson, and R.M. Thrall.
The double description method.
In H.W. Kuhn and A.W.Tucker, editors, Contributions to theory of games, Vol. 2. Princeton University Press, Princeton, RI, 1953.

15

K. Mulmuley.
Computational Geometry, An Introduction Through Randamized Algorithms.
Prentice-Hall, 1994.

16

D.K. Wilde.
A library for doing polyhedral operations.
Master's thesis, Oregon State University, Corvallis, Oregon, Dec 1993.
Also published in IRISA technical report PI 785, Rennes, France; Dec, 1993.