Terminal subsets of convex sets in finite-dimensional real normed spaces
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.
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.
We survey results concerning the extent to which information about a convex body's projections or sections determine that body. We will see that, if the body is known to be centrally symmetric, then it is determined by the size of its projections. However, without the symmetry condition, knowledge of the average shape of projections or sections often determines the body. Rather surprisingly, the dimension of the projections or sections plays a key role and exceptional cases do occur but appear to...