Concave polygon a convex polygon. As with any simple polygon, the sum of the internal angles of a concave polygon is ("n" − 2) radians, equivalently 180°×("n" − 2), where "n" is the number of sides. 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 . A triangle can never be concave, but there exist concave polygons with "n" sides for any "n" > 3. An example of a concave quadrilateral is the dart. At least one interior angle
Parallel projection Parallel projection A parallel projection is a projection of an object in three-dimensional space onto a fixed plane, known as the "projection plane" or "image plane", where the "rays", known as "lines of sight" or "projection lines", are parallel to each other. It is a basic tool in descriptive geometry. The projection is called "orthographic" if the rays are perpendicular (orthogonal) to the image plane, and "oblique" or "skew" if they are not. A parallel projection is a particular case of "projection" in mathematics and "graphical projection" in technical drawing. Parallel projections can be seen as the limit of a