Toroidal polyhedron

In geometry, a toroidal polyhedron is a polyhedron which is also a toroid (a g-holed torus), having a topological genus (g) of 1 or greater. Notable examples include the Császár and Szilassi polyhedra. Toroidal polyhedra are defined as collections of polygons that meet at their edges and vertices, forming a manifold as they do. That is, each edge should be shared by exactly two polygons, and at each vertex the edges and faces that meet at the vertex should be linked together in a single cycle of alternating edges and faces, the link of the vertex. For toroidal polyhedra, this manifold is an orientable surface. Some authors restrict the phrase "toroidal polyhedra" to mean more specifically polyhedra topologically equivalent to the (genus 1) torus. In this area, it is important to distinguish embedded toroidal polyhedra, whose faces are flat polygons in three-dimensional Euclidean space that do not cross themselves or each other, from abstract polyhedra, topological surfaces without any specified geometric realization. Intermediate between these two extremes are polyhedra formed by geometric polygons or star polygons in Euclidean space that are allowed to cross each other. In all of these cases the toroidal nature of a polyhedron can be verified by its orientability and by its Euler characteristic being non-positive. The Euler characteristic generalizes to V − E + F = 2 − 2N, where N is the number of holes. Two of the simplest possible embedded toroidal polyhedra are the Császár and Szilassi polyhedra. The Császár polyhedron is a seven-vertex toroidal polyhedron with 21 edges and 14 triangular faces. It and the tetrahedron are the only known polyhedra in which every possible line segment connecting two vertices forms an edge of the polyhedron. Its dual, the Szilassi polyhedron, has seven hexagonal faces that are all adjacent to each other, hence providing the existence half of the theorem that the maximum number of colors needed for a map on a (genus one) torus is seven.

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.

Related publications (18)

Related people (3)

Related units (1)

Related concepts (16)

Related courses (3)

Related lectures (19)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective.

MGT-483: Optimal decision making

This course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marke

MATH-504: Integer optimisation

The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s

In geometry, a spherical polyhedron or spherical tiling is a tiling of the sphere in which the surface is divided or partitioned by great arcs into bounded regions called spherical polygons. Much of the theory of symmetrical polyhedra is most conveniently derived in this way. The most familiar spherical polyhedron is the soccer ball, thought of as a spherical truncated icosahedron. The next most popular spherical polyhedron is the beach ball, thought of as a hosohedron.

In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

In geometry, the Császár polyhedron (ˈt͡ʃaːsaːr) is a nonconvex toroidal polyhedron with 14 triangular faces. This polyhedron has no diagonals; every pair of vertices is connected by an edge. The seven vertices and 21 edges of the Császár polyhedron form an embedding of the complete graph K_7 onto a topological torus. Of the 35 possible triangles from vertices of the polyhedron, only 14 are faces.

Designing Pavilion Structures AR-211: Stereotomy

Explores the design process of pavilion structures, emphasizing the creation of a topological polyhedron as the foundation document.

Document de FOND PAVILLON: Énoncé du Rendu 2a AR-211: Stereotomy

Provides detailed guidelines for a pavilion project, emphasizing effective resource utilization.

Integer Optimization: Theory and Applications MATH-504: Integer optimisation

Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.

Synthesis and properties of heterostructures in nanowires and 2-D materials

Akshay Balgarkashi

Modern solid-state devices were made possible by the discovery of semiconductor heterostructures. Heterostructures offer the ability to fabricate low-dimensional nanostructures such as quantum dots which can restrain carriers in all three-directions. Quant ...

EPFL2022

JET ILA full array and polychromatic operation

The JET ILA is an Ion Cyclotron Resonance Heating (ICRH) antenna composed of four resonant double loops (RDLs) arranged in a 2 toroidal by 2 poloidal compact array. It has been operated in a range of frequencies from 29 to 51 MHz, but mostly on half array. ...

ELSEVIER SCIENCE SA2021

Warped tori with almost non-negative scalar curvature

Davide Parise

For sequences of warped product metrics on a 3-torus satisfying the scalar curvature bound Rj = -1j, uniform upper volume and diameter bounds, and a uniform lower area bound on the smallest minimal surface, we find a subsequence which converges in both the ...

SPRINGER2019