Algorithmethumb|Algorithme de découpe d'un polygone quelconque en triangles (triangulation). Un algorithme est une suite finie et non ambiguë d'instructions et d’opérations permettant de résoudre une classe de problèmes. Le domaine qui étudie les algorithmes est appelé l'algorithmique. On retrouve aujourd'hui des algorithmes dans de nombreuses applications telles que le fonctionnement des ordinateurs, la cryptographie, le routage d'informations, la planification et l'utilisation optimale des ressources, le , le traitement de textes, la bio-informatique L' algorithme peut être mis en forme de façon graphique dans un algorigramme ou organigramme de programmation.
Facet (geometry)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.
Five-dimensional spaceA five-dimensional space is a space with five dimensions. In mathematics, a sequence of N numbers can represent a location in an N-dimensional space. If interpreted physically, that is one more than the usual three spatial dimensions and the fourth dimension of time used in relativistic physics. Whether or not the universe is five-dimensional is a topic of debate. Much of the early work on five-dimensional space was in an attempt to develop a theory that unifies the four fundamental interactions in nature: strong and weak nuclear forces, gravity and electromagnetism.
Courbe convexeIn geometry, a convex curve is a plane curve that has a supporting line through each of its points. There are many other equivalent definitions of these curves, going back to Archimedes. Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves include the closed convex curves (the boundaries of bounded convex sets), the smooth curves that are convex, and the strictly convex curves, which have the additional property that each supporting line passes through a unique point of the curve.
Balanced setIn linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space (over a field with an absolute value function ) is a set such that for all scalars satisfying The balanced hull or balanced envelope of a set is the smallest balanced set containing The balanced core of a set is the largest balanced set contained in Balanced sets are ubiquitous in functional analysis because every neighborhood of the origin in every topological vector space (TVS) contains a balanced neig
Schwarz minimal surfaceIn differential geometry, the Schwarz minimal surfaces are periodic minimal surfaces originally described by Hermann Schwarz. In the 1880s Schwarz and his student E. R. Neovius described periodic minimal surfaces. They were later named by Alan Schoen in his seminal report that described the gyroid and other triply periodic minimal surfaces. The surfaces were generated using symmetry arguments: given a solution to Plateau's problem for a polygon, reflections of the surface across the boundary lines also produce valid minimal surfaces that can be continuously joined to the original solution.
