Search results
Results from the WOW.Com Content Network
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.
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 ...
The side view is an isosceles trapezoid. In first-angle projection, the front view is pushed back to the rear wall, and the right side view is pushed to the left wall, so the first-angle symbol shows the trapezoid with its shortest side away from the circles.
Except in the triangle case, an equilateral polygon does not need to also be equiangular (have all angles equal), but if it does then it is a regular polygon. If the number of sides is at least four, an equilateral polygon does not need to be a convex polygon: it could be concave or even self-intersecting.
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).
Polygons with only one concave vertex can always be fan triangulated, as long as the diagonals are drawn from the concave vertex. It can be known if a polygon can be fan triangulated by solving the Art gallery problem, in order to determine whether there is at least one vertex that is visible from every point in the polygon.
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]
A regular triangle, heptagon, and 42-gon can completely fill a plane vertex. However, there is no tiling of the plane with only these polygons, because there is no way to fit one of them onto the third side of the triangle without leaving a gap or creating an overlap. In the hyperbolic plane, tilings by regular heptagons are possible. There are ...