Fukuda, KomeiLiebling, Thomas M.Lütolf, Christine2006-02-132006-02-132006-02-13200110.1016/S0925-7721(01)00032-3https://infoscience.epfl.ch/handle/20.500.14299/222970In this paper we address the problem of computing a minimal representation of the convex hull of the union of k H- polytopes in . Our method applies the reverse search algorithm to a shelling ordering of the facets of the convex hull. Efficient wrapping is done by projecting the polytopes onto the two-dimensional space and solving a linear program. The resulting algorithm is polynomial in the sizes of input and output under the general position assumption.Convex hullPolytopesLinear programmingtext::journal::journal article::research article