Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1312-1574-2 |
Объём: | 100 страниц |
Масса: | 172 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! In geometry, a polygon can be either convex or concave. A polygon that is not convex is called concave or reentrant. A concave polygon will always have an interior angle with a measure that is greater than 180 degrees. It is possible to cut 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
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.