Convex and Concave Polygons
978-613-1-21574-2
613121574X
100
2010-08-13
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786131215742.jpg
https://images.our-assets.com/fullcover/230x230/9786131215742.jpg
https://images.our-assets.com/cover/2000x/9786131215742.jpg
https://images.our-assets.com/fullcover/2000x/9786131215742.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 & Dobkin (1985).
https://www.morebooks.shop/books/pt/published_by/betascript-publishing/1/products
Geometria
https://www.morebooks.shop/store/pt/book/convex-and-concave-polygons/isbn/978-613-1-21574-2