Title: Software package for polyhedra operation Author: Veronika Steffanová Department: Department of Applied Mathematics Supervisor: Mgr. Milan Hladík, Ph.D., Department of Applied Mathematics Abstract: The topic of the thesis is focused on convex polyhedra and algorithms for working with them. At first we give the theorem about vertex and facet description and then we describe selected algorithms connected to the problem of the conversion between these two descriptions. In the practical part we implement three functions using three selected algorithms and a few other functions, which are simple results of the three algorithms. Finally we get a MATLAB library, which contains functions for vertex enumeration, facet enumeration, convex union...
The domain of convex polyhedra plays a special role in the collection of numerical domains considere...
International audienceWe study the development of formally proved algorithms for computational geome...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...
Název práce: Softwarový balík pro práci s polyedry Autor: Veronika Steffanová Katedra: Katedra aplik...
This thesis describes an algorithm for calculating the theoretic set operations union, intersection,...
Every convex polytope is both the intersection of a finite set of halfspaces and the convex hull of ...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
In this paper we describe the DCEL system: a geometric software package which implements a polyhedra...
This research effort focuses on the acquisition of polyhedral outer-approximations to the convex hul...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
In this paper, we investigate the applicability of backtrack technique to solve the vertex enumerati...
We present a new piv ot-based algorithm which can be used with minor modification for the enumeratio...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
The domain of convex polyhedra plays a special role in the collection of numerical domains considere...
International audienceWe study the development of formally proved algorithms for computational geome...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...
Název práce: Softwarový balík pro práci s polyedry Autor: Veronika Steffanová Katedra: Katedra aplik...
This thesis describes an algorithm for calculating the theoretic set operations union, intersection,...
Every convex polytope is both the intersection of a finite set of halfspaces and the convex hull of ...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
In this paper we describe the DCEL system: a geometric software package which implements a polyhedra...
This research effort focuses on the acquisition of polyhedral outer-approximations to the convex hul...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
In this paper, we investigate the applicability of backtrack technique to solve the vertex enumerati...
We present a new piv ot-based algorithm which can be used with minor modification for the enumeratio...
The polyhedral approach is one of the most powerful techniques available for solving hard combinator...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
The domain of convex polyhedra plays a special role in the collection of numerical domains considere...
International audienceWe study the development of formally proved algorithms for computational geome...
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex ...