Search results
Results from the WOW.Com Content Network
A polygon ear. One way to triangulate a simple polygon is based on the two ears theorem, as the fact that any simple polygon with at least 4 vertices without holes has at least two "ears", which are triangles with two sides being the edges of the polygon and the third one completely inside it. [5]
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] A triangle can never be concave, but there exist concave polygons with n sides for any n > 3.
Convex equilateral pentagon dissected into 3 triangles, which helps to calculate the value of angle δ as a function of α and β. When a convex equilateral pentagon is dissected into triangles, two of them appear as isosceles (triangles in orange and blue) while the other one is more general (triangle in green).
A convex equilateral pentagon can be described by two consecutive angles, which together determine the other angles. However, equilateral pentagons, and equilateral polygons with more than five sides, can also be concave, and if concave pentagons are allowed then two angles are no longer sufficient to determine the shape of the pentagon.
An arrangement is said to be simple when at most two lines cross at each vertex, and simplicial when all cells are triangles (including the unbounded cells, as subsets of the projective plane). There are three known infinite families of simplicial arrangements, as well as many sporadic simplicial arrangements that do not fit into any known family.
This is a list of two-dimensional geometric shapes in Euclidean and other geometries. For mathematical objects in more dimensions, see list of mathematical shapes. For a broader scope, see list of shapes.
Fan triangulation of a convex polygon Fan triangulation of a concave polygon with a unique concave vertex. In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices of the polygon.
It is possible to divide an equilateral triangle into three congruent non-convex pentagons, meeting at the center of the triangle, and to tile the plane with the resulting three-pentagon unit. [21] A similar method can be used to subdivide squares into four congruent non-convex pentagons, or regular hexagons into six congruent non-convex ...