Tangent cones, starshape and convexity.
Tangent segments in Minkowski planes.
Terminal subsets of convex sets in finite-dimensional real normed spaces
Tessellations Generated by Hyperplanes.
Testing of convex polyhedron visibility by means of graphs
This paper follows the article by V. Medek which solves the problem of finding the boundary of a convex polyhedron in both parallel and central projections. The aim is to give a method which yields a simple algorithm for the automation of an arbitrary graphic projection of a convex polyhedron. Section 1 of this paper recalls some necessary concepts from the graph theory. In Section 2 graphs are applied to determine visibility of a convex polyhedron.
The Aleksandrov-Fenchel type inequalities for volume differences.
The barrier cone of a convex set and the closure of the cover.
The Bellows conjecture.
The best constant for a geometric inequality.
The best constant for an algebraic inequality.
The best constants for a double inequality in a triangle.
The bottleneck conjecture.
The calculus of operator functions and operator convexity [Book]
The Cayley–Menger determinant is irreducible for .
The Complexity of Cutting Complexes.
The convex floating body.
The Convex Hull of a Typical Compact Set.
The convexity of the subset space of a metric space
The Demyanov metric and some other metrics in the family of convex sets
We describe some known metrics in the family of convex sets which are stronger than the Hausdorff metric and propose a new one. These stronger metrics preserve in some sense the facial structure of convex sets under small changes of sets.
The densest packing of 12 congruent circles in a circle.