enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Equilateral pentagon - Wikipedia

    en.wikipedia.org/wiki/Equilateral_pentagon

    There are two infinite families of equilateral convex pentagons that tile the plane, one having two adjacent supplementary angles and the other having two non-adjacent supplementary angles. Some of those pentagons can tile in more than one way, and there is one sporadic example of an equilateral pentagon that can tile the plane but does not ...

  3. Pentagonal tiling - Wikipedia

    en.wikipedia.org/wiki/Pentagonal_tiling

    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 ...

  4. Polygon triangulation - Wikipedia

    en.wikipedia.org/wiki/Polygon_triangulation

    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]

  5. Digon - Wikipedia

    en.wikipedia.org/wiki/Digon

    In geometry, a bigon, [1] digon, or a 2-gon, is a polygon with two sides and two vertices.Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space.

  6. Concave polygon - Wikipedia

    en.wikipedia.org/wiki/Concave_polygon

    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.

  7. Heptagon - Wikipedia

    en.wikipedia.org/wiki/Heptagon

    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 ...

  8. Kite (geometry) - Wikipedia

    en.wikipedia.org/wiki/Kite_(geometry)

    One diagonal crosses the midpoint of the other diagonal at a right angle, forming its perpendicular bisector. [9] (In the concave case, the line through one of the diagonals bisects the other.) One diagonal is a line of symmetry. It divides the quadrilateral into two congruent triangles that are mirror images of each other. [7]

  9. Euclidean geometry - Wikipedia

    en.wikipedia.org/wiki/Euclidean_geometry

    Many results about plane figures are proved, for example, "In any triangle, two angles taken together in any manner are less than two right angles." (Book I proposition 17) and the Pythagorean theorem "In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle."