Art of Problem Solving

Concave polyhedron: Difference between revisions

mNo edit summary
mNo edit summary
 
(2 intermediate revisions by one other user not shown)
Line 1: Line 1:
A '''concave polyhedron''' is a polyhedron such that you can select two [[point]]s inside it such that the [[line segment]] drawn between them contains points not in the polyhedron.  In other words, a polyhedron is concave exactly when it is not [[convex polyhedron | convex]].   
A '''concave polyhedron''' is a [[polyhedron]] with the property that there exist two [[point]]s inside it such that the [[line segment]] drawn between them contains points not in the polyhedron.  In other words, a polyhedron is concave exactly when it is not [[convex polyhedron | convex]].   
 


==See Also==
==See Also==
*[[Convex polyhedron]]
*[[Concave polygon]]
*[[Concave polygon]]



Latest revision as of 20:24, 25 April 2008

A concave polyhedron is a polyhedron with the property that there exist two points inside it such that the line segment drawn between them contains points not in the polyhedron. In other words, a polyhedron is concave exactly when it is not convex.

See Also

This article is a stub. Help us out by expanding it.