Intersection of a Convex Polyhedron and a Plane

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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.


Contributed by: Frederick Wu (October 2011)
Based on a program by: Wouter L. J. Meeussen and Eric W. Weisstein
With corrections by: Max W. Schmidt
Open content licensed under CC BY-NC-SA




[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.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.