Definition
In geometry, a Schönhardt polyhedron is a polyhedron with the same combinatorial structure as a regular octahedron, but with dihedral angles that are non-convex along three disjoint edges. Because it has no interior diagonals, it cannot be triangulated into tetrahedra without adding new vertices. It has the fewest vertices of any polyhedron that cannot be triangulated. It is named after the German mathematician Erich Schönhardt, who described it in 1928, although the artist Karlis Johansons had exhibited a related structure in 1921. It was also rediscovered in 1965 by W. Wunderlich.
Related concepts
American Mathematical MonthlyAntiprismBoolean logicBoolean satisfiability problemBranko GrünbaumBricard octahedronCauchy's theorem (geometry)Convex hullConvex polyhedronConvex setCsászár polyhedronDavid A. KlarnerDiagonalDihedral angleDihedral groupDiscrete & Computational GeometryEdge (geometry)Elemente der MathematikEmo WelzlErich SchönhardtFace (geometry)Flexible polyhedronFrancisco Santos LealFrederick BagemihlGadget (computer science)GeometryGünter M. ZieglerJacob E. GoodmanJessen's icosahedronJesús A. De LoeraJohn M. Sullivan (mathematician)János PachKarlis JohansonsList of spherical symmetry groupsManifoldMartin AignerMathematische AnnalenMathgrrlNP-completeNet (polyhedron)Polyhedra (book)PolyhedronProofs from THE BOOKRaimund SeidelReduction (complexity)Regular icosahedronRegular octahedronRobert ConnellySkew polygonStructural rigiditySymmetric differenceTensegrityTetrahedronTriangular prismTriangulation (geometry)Vertex (geometry)
3 concepts already in your glossary