Andere Kunden interessierten sich auch für
![Concave Set]( "Concave Set")
Concave Set25,99 €![Moufang Polygons]( "Moufang Polygons")
Moufang Polygons74,99 €![A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra]( "A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra")
A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra54,99 €![A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra]( "A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra")
A Geometric Analysis of the Platonic Solids and Other Semi-Regular Polyhedra70,99 €![Convex Hull Algorithms]( "Convex Hull Algorithms")
Convex Hull Algorithms22,99 €![Convex Cone]( "Convex Cone")
Convex Cone22,99 €![Polynomial- Time Algorithm for Volume of Convex Bodies]( "Polynomial- Time Algorithm for Volume of Convex Bodies")
Polynomial- Time Algorithm for Volume of Convex Bodies29,99 €
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 & Dobkin (1985).