Extended convex hull

In 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.


Published in:
Computational Geometry, 20, 1-2, 13-23
Year:
2001
Keywords:
Note:
PRO 01.10
Laboratories:




 Record created 2006-02-13, last modified 2018-10-07

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)