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
Lens (optics) object off the optical axis of the lens is imaged, where rays pass through the lens at an angle to the axis θ. Rays that pass through the centre of a lens of focal length "f" are focused at a point with distance from the axis. Rays passing through the outer margins of the lens are focused at different points, either further from the axis (positive coma) or closer to the axis (negative coma). In general, a bundle of parallel rays passing through the lens at a fixed distance from the centre of the lens are focused to a ring-shaped