A convex polytope is the convex hull of a finite set of points in
euclidean space R^d. Given a finite number of polytopes (each
represented by its vertices) we want to know whether the union of these
polytopes is convex or not. In this talk I will present a theorem by
Barany and Fukuda providing a necessary and sufficient condition for the
union to be convex.