A simple polygon that is not convex is called concave, non-convex or reentrant. A concave polygon will always have at least one reflex interior angle—that is, an angle with a measure that is between 180 degrees and 360 degrees exclusive.
Some lines containing interior points of a concave polygon intersect its boundary at more than two points. Some diagonals of a concave polygon lie partly or wholly outside the polygon. Some sidelines of a concave polygon fail to divide the plane into two half-planes one of which entirely contains the polygon. None of these three statements holds for a convex polygon.
It is always possible to partition a concave polygon into a set of convex polygons. A polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin (1985).
At least one interior angle does not contain all other vertices in its edges and interior.
The convex hull of the concave polygon's vertices, and that of its edges, contains points that are exterior to the polygon.
- McConnell, Jeffrey J. (2006), Computer Graphics: Theory Into Practice, p. 130, ISBN 0-7637-2250-2.
- Leff, Lawrence (2008), Let's Review: Geometry, Hauppauge, NY: Barron's Educational Series, p. 66, ISBN 978-0-7641-4069-3
- Mason, J.I. (1946), "On the angles of a polygon", The Mathematical Gazette, The Mathematical Association, 30 (291): 237–238, doi:10.2307/3611229, JSTOR 3611229.
- "Definition and properties of concave polygons with interactive animation".
- Chazelle, Bernard; Dobkin, David P. (1985), "Optimal convex decompositions", in Toussaint, G.T. (ed.), Computational Geometry (PDF), Elsevier, pp. 63–133.