User:Dedhert.Jr/sandbox/1

This is the user sandbox of Dedhert.Jr. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

A convex polyhedron is a polyhedron that forms a convex set as a solid. That being said, it is a three-dimensional solid whose every line segment connects two of its points lies its interior or on its boundary; none of its faces are coplanar (they do not share the same plane) and none of its edges are collinear (they are not segments of the same line).^[1]^[2] A convex polyhedron can also be defined as a bounded intersection of finitely many half-spaces, or as the convex hull of finitely many points, in either case restricted to intersections or hulls that have nonzero volume.

^ Boissonnat, J. D.; Yvinec, M. (June 1989). Probing a scene of non convex polyhedra. Proceedings of the fifth annual symposium on Computational geometry. pp. 237–246. doi:10.1145/73833.73860.
^ Litchenberg, D. R. (1988). "Pyramids, Prisms, Antiprisms, and Deltahedra". The Mathematics Teacher. 81 (4): 261–265. JSTOR 27965792.

[by-1] Boissonnat, J. D.; Yvinec, M. (June 1989). Probing a scene of non convex polyhedra. Proceedings of the fifth annual symposium on Computational geometry. pp. 237–246. doi:10.1145/73833.73860.

[litchenberg-2] Litchenberg, D. R. (1988). "Pyramids, Prisms, Antiprisms, and Deltahedra". The Mathematics Teacher. 81 (4): 261–265. JSTOR 27965792.

[1]

[2]