Search results
Results from the WOW.Com Content Network
The Schläfli symbol of a convex regular polygon with p edges is {p}. For example, a regular pentagon is represented by {5}. For nonconvex star polygons , the constructive notation { p ⁄ q } is used, where p is the number of vertices and q −1 is the number of vertices skipped when drawing each edge of the star.
A p-gonal regular polygon is represented by Schläfli symbol {p}. Many sources only consider convex polygons, but star polygons, like the pentagram, when considered, can also be regular. They use the same vertices as the convex forms, but connect in an alternate connectivity which passes around the circle more than once to be completed.
The octahedron is dual to the cube. For every convex polyhedron, there exists a dual polyhedron having faces in place of the original's vertices and vice versa, and; the same number of edges. The dual of a convex polyhedron can be obtained by the process of polar reciprocation. [21]
A regular octahedron is an octahedron that is a regular polyhedron. All the faces of a regular octahedron are equilateral triangles of the same size, and exactly four triangles meet at each vertex. A regular octahedron is convex, meaning that for any two points within it, the line segment connecting them lies entirely within it.
This fact can be used to calculate the dihedral angles themselves for a regular or edge-symmetric ideal polyhedron (in which all these angles are equal), by counting how many edges meet at each vertex: an ideal regular tetrahedron, cube or dodecahedron, with three edges per vertex, has dihedral angles = / = (), an ideal regular octahedron or ...
The classical convex polytopes may be considered tessellations, or tilings, of spherical space. Tessellations of euclidean and hyperbolic space may also be considered regular polytopes. Tessellations of euclidean and hyperbolic space may also be considered regular polytopes.
Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes. Research in polyhedral combinatorics falls into two distinct areas.
The Schlegel diagram of a convex polyhedron represents its vertices and edges as points and line segments in the Euclidean plane, forming a subdivision of an outer convex polygon into smaller convex polygons (a convex drawing of the graph of the polyhedron).