| Abstrakt: |
In this paper methods and algorithms for identifying the main elements (edges and facets of any dimension) of a cone and a polytope, and calculating the corresponding hypervolumes are presented. The cones and polytopes are supposed to be given as the non-negative linear combination and the convex hull generated by a, not necessarily minimal, set of vectors (points), respectively, and they can be degenerated (of a dimension smaller that that of the proper space in which they are contained). First a minimum set of generators (edges and vertices) are obtained by eliminating the redundant vectors. In the case of cones, the linear space basis and the minimal cone generators are obtained. Second the set of all facets of any dimension are identified. Finally, an algorithm for obtaining the associated hypervolumes of any dimension, i.e. the length of its edges, the areas of its faces of dimension two, and the hypervolumes of its facets of any dimension, is introduced. The proposed formula leads to a recursion that gives the hypervolumes of dimension n as a function of other hypervolumes of dimension n - 1. Examples are used to illustrate the proposed methods and algorithms. [ABSTRACT FROM AUTHOR] |
