From the zonotope construction to the Minkowski addition of convex polytopes

Journal of Symbolic Computation

Volumn 38, Issue 4, 2004, Pages 1261-1272

  Fukuda, Komei ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Convex polytope; Efficient algorithm; Minkowski addition; Reverse search

Indexed keywords

EID: 4344711578     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2003.08.007     Document Type: Article

References (8)

1. Avis D. Fukuda K. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra Discrete Comput. Geom. 8 1992-295 313
2. Avis D. Fukuda K. Reverse search for enumeration Discrete Appl. Math. 65 1996 21-46
3. Ferrez J. Fukuda K. Liebling T.M. Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm European J. Oper. Res. 2003 (in press)
4. Fukuda K. Ferrez J. 2002. Implementations of LP-based reverse search algorithms for the zonotope construction and the fixed-rank convex quadratic maximization in binary variables using the zram and the cddlib libraries http://www.cs.mcgill.ca/~fukuda/ download/mink/RS_TOPE020713.tar.gz
5. Giordano M. Kataya B. Pairel E. Tolerance analysis and synthesis by means of clearance and deviation spaces 7th CIRP International Seminar on Computer-Aided Tolerancing ENS de Cachan, France, April, 2001 2001
6. Gritzmann P. Sturmfels B. Minkowski addition of polytopes: computational complexity and applications to Gröbner bases SIAM J. Discrete Math. 6 1993 246-269
7. Seymour P. A note on hyperplane generation J. Combin. Theory Ser. B 61 1994 88-91
8. Sturmfels B. 1998 Polynomial equations and convex polytopes. Amer. Math. Monthly 105 (10), 907-922