Search results
Results from the WOW.Com Content Network
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.
Lists of shapes cover different types of geometric shape and related topics. They include mathematics topics and other lists of shapes, such as shapes used by drawing or teaching tools. They include mathematics topics and other lists of shapes, such as shapes used by drawing or teaching tools.
Gaussian curve with a two-dimensional domain. Many shapes have metaphorical names, i.e., their names are metaphors: these shapes are named after a most common object that has it. For example, "U-shape" is a shape that resembles the letter U, a bell-shaped curve has the shape of the vertical cross section of a bell, etc.
Tessellations of euclidean and hyperbolic space may also be considered regular polytopes. Note that an 'n'-dimensional polytope actually tessellates a space of one dimension less. For example, the (three-dimensional) platonic solids tessellate the 'two'-dimensional 'surface' of the sphere.
Pages in category "Geometric shapes" ... Glossary of shapes with metaphorical names; Shape; 0–9. List of two-dimensional geometric shapes; A. Annulus (mathematics) ...
However, a mirror image could be called a different shape. For instance, a "b" and a "p" have a different shape, at least when they are constrained to move within a two-dimensional space like the page on which they are written. Even though they have the same size, there's no way to perfectly superimpose them by translating and rotating them ...
John Skilling discovered an overlooked degenerate example, by relaxing the condition that only two faces may meet at an edge. This is a degenerate uniform polyhedron rather than a uniform polyhedron, because some pairs of edges coincide. Not included are: The uniform polyhedron compounds.
In geometry, a polygon is traditionally a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain. These segments are called its edges or sides , and the points where two of the edges meet are the polygon's vertices (singular: vertex) or corners .