In geometry, a simplicial polytope is a polytope whose facets are all simplices. For example, a simplicial polyhedron in three dimensions contains only triangular faces and corresponds via Steinitz's theorem to a maximal planar graph.
They are topologically dual to simple polytopes. Polytopes which are both
simple and simplicial are either simplices or two-dimensional polygons.
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
In geometry and polyhedral combinatorics, the Kleetope of a polyhedron or higher-dimensional convex polytope P is another polyhedron or polytope PK formed by replacing each facet of P with a shallow pyramid. Kleetopes are named after Victor Klee. The triakis tetrahedron is the Kleetope of a tetrahedron, the triakis octahedron is the Kleetope of an octahedron, and the triakis icosahedron is the Kleetope of an icosahedron. In each of these cases the Kleetope is formed by adding a triangular pyramid to each face of the original polyhedron.
En géométrie, le disphénoïde adouci est un des solides de Johnson (J84). C'est un polyèdre qui possède seulement des faces formées de triangles équilatéraux, et est, par conséquent un deltaèdre. Ce n'est pas un polyèdre régulier car certains sommets ont quatre faces et d'autres en ont cinq. C'est un des solides de Johnson élémentaires qui n'apparaît pas à partir de manipulation en « copier/coller » de solides de Platon et de solides d'Archimèdes. Il a douze faces et constitue ainsi un exemple de dodécaèdre.
In geometry, a facet is a feature of a polyhedron, polytope, or related geometric structure, generally of dimension one less than the structure itself. More specifically: In three-dimensional geometry, a facet of a polyhedron is any polygon whose corners are vertices of the polyhedron, and is not a face. To facet a polyhedron is to find and join such facets to form the faces of a new polyhedron; this is the reciprocal process to stellation and may also be applied to higher-dimensional polytopes.
Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...
We consider two basic problems of algebraic topology: the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given topological space ...
Springer2014
The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...