Concept

Duopyramid

In geometry of 4 dimensions or higher, a double pyramid or duopyramid or fusil is a polytope constructed by 2 orthogonal polytopes with edges connecting all pairs of vertices between the two. The term fusil is used by Norman Johnson as a rhombic-shape. The term duopyramid was used by George Olshevsky, as the dual of a duoprism. The lowest dimensional forms are 4 dimensional and connect two polygons. A p-q duopyramid or p-q'' fusil, represented by a composite Schläfli symbol {p} + {q}, and Coxeter-Dynkin diagram . The regular 16-cell can be seen as a 4-4 duopyramid or 4-4 fusil, , symmetry , order 128. A p-q duopyramid or p-q fusil has Coxeter group symmetry [p,2,q], order 4pq. When p and q are identical, the symmetry in Coxeter notation is doubled as or [2p,2+,2q], order 8p2. Edges exist on all pairs of vertices between the p-gon and q-gon. The 1-skeleton of a p-q duopyramid represents edges of each p and q polygon and pq complete bipartite graph between them. A p-q duopyramid can be seen as two regular planar polygons of p and q sides with the same center and orthogonal orientations in 4 dimensions. Along with the p and q edges of the two polygons, all permutations of vertices in one polygon to vertices in the other form edges. All faces are triangular, with one edge of one polygon connected to one vertex of the other polygon. The p and q sided polygons are hollow, passing through the polytope center and not defining faces. Cells are tetrahedra constructed as all permutations of edge pairs between each polygon. It can be understood by analogy to the relation of the 3D prisms and their dual bipyramids with Schläfli symbol { } + {p}, and a rhombus in 2D as { } + { }. A bipyramid can be seen as a 3D degenerated duopyramid, by adding an edge across the digon { } on the inner axis, and adding intersecting interior triangles and tetrahedra connecting that new edge to p-gon vertices and edges. Other nonuniform polychora can be called duopyramids by the same construction, as two orthogonal and co-centered polygons, connected with edges with all combinations of vertex pairs between the polygons.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.