Concave polygon
From Infogalactic: the planetary knowledge core
A simple polygon that is not convex is called concave,[1] non-convex[2] or reentrant.[3] A simple concave polygon will always have an interior angle with a measure that is greater than 180 degrees.[4]
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).[5]
Notes
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Definition and properties of concave polygons with interactive animation.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..