TOPICS
Search

Search Results for ""


61 - 70 of 830 for Convex PolyhedronSearch Results
A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...
A polyhedron constructed by ruling 2n equally spaced vertical lines along the surface of a cylinder together with 2n^3 circles around the cylinder at equally spaced heights. ...
A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...
A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...
The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...
A regular skew polyhedron is a polyhedron whose faces and vertex figures are regular skew polygons. There are only three regular skew polyhedra in Euclidean three-space ...
A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...
"Conext 21 polyhedron" is the name given here to the solid underlying the soccer ball of the 2020 Tokyo Olympic Games (held in 2021). It is implemented in the Wolfram ...
Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).
The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...
1 ... 4|5|6|7|8|9|10 ... 83 Previous Next

...