On the Number of Minimal 1-Steiner Trees.
On the separation of parametric convex polyhedral sets with application in MOLP
We investigate diverse separation properties of two convex polyhedral sets for the case when there are parameters in one row of the constraint matrix. In particular, we deal with the existence, description and stability properties of the separating hyperplanes of such convex polyhedral sets. We present several examples carried out on PC. We are also interested in supporting separation (separating hyperplanes support both the convex polyhedral sets at given faces) and permanent separation (a hyperplane...
Optimality of the Delaunay Triangulation in Rd .
Recognizing graph theoretic properties with polynomial ideals.
Separation by hyperplanes in finite-dimensional vector spaces over Archimedean ordered fields.
Simplices rarely contain their circumcenter in high dimensions
Acute triangles are defined by having all angles less than , and are characterized as the triangles containing their circumcenter in the interior. For simplices of dimension , acuteness is defined by demanding that all dihedral angles between -dimensional faces are smaller than . However, there are, in a practical sense, too few acute simplices in general. This is unfortunate, since the acuteness property provides good qualitative features for finite element methods. The property of acuteness...
Support properties of a family of connected compact sets
A problem of finding a system of proportionally located parallel supporting hyperplanes of a family of connected compact sets is analyzed. A special attention is paid to finding a common supporting halfspace. An existence theorem is proved and a method of solution is proposed.
The special cuts of the 600-cell.
The Upper Envelope of Voronoi Surfaces and Its Applications.
Uniform decompositions of polytopes
We design a method of decomposing convex polytopes into simpler polytopes. This decomposition yields a way of calculating exactly the volume of the polytope, or, more generally, multiple integrals over the polytope, which is equivalent to the way suggested in Schechter, based on Fourier-Motzkin elimination (Schrijver). Our method is applicable for finding uniform decompositions of certain natural families of polytopes. Moreover, this allows us to find algorithmically an analytic expression for the...
Weitere NP-schwere Probleme für minimale Polygonüberdeckungen
Вычисление экспоненциальных интегралов