This Demonstration shows that the intersection of an arbitrary convex polyhedron by an arbitrary plane is a convex polygon.

The polyhedron is created by randomly selecting points and then taking the convex hull of those points. It is possible that the actual number of vertices will be less than the chosen number of points.

[1] F. Wu, et. al., "Design and Algorithm for Polyhedron Metro Frame of Lithographic Machine," China Mechanical Engineering, 24(9), 2013, pp.1164–1168 DOI:10.3969/j.issn.1004-132X .2013.09.007

[2] M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry Algorithms and Applications, 3rd ed., Berlin: Springer, 2008 pp. 243–258.