The tropical double description method - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

The tropical double description method


We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities). The heart of the tropical algorithm is a characterization of the extreme points of a polyhedron in terms of a system of constraints which define it. We show that checking the extremality of a point reduces to checking whether there is only one minimal strongly connected component in an hypergraph. The latter problem can be solved in almost linear time, which allows us to eliminate quickly redundant generators. We report extensive tests (including benchmarks from an application to static analysis) showing that the method outperforms experimentally the previous ones by orders of magnitude. The present tools also lead to worst case bounds which improve the ones provided by previous methods.
Fichier principal
Vignette du fichier
AllamigeonGaubertGoubault.pdf (960.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455341 , version 1 (10-02-2010)


  • HAL Id : inria-00455341 , version 1


Xavier Allamigeon, Stéphane Gaubert, Eric Goubault. The tropical double description method. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.47-58. ⟨inria-00455341⟩
409 View
309 Download


Gmail Facebook X LinkedIn More