- symmetric polygons
- мат. симметричные многоугольники
Большой англо-русский и русско-английский словарь. 2001.
symmetric polygons
Смотреть что такое "symmetric polygons" в других словарях:
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Tessellation — A tessellation of pavement A honeycomb is an example of a t … Wikipedia
Platonic solid — In geometry, a Platonic solid is a convex polyhedron that is regular, in the sense of a regular polygon. Specifically, the faces of a Platonic solid are congruent regular polygons, with the same number of faces meeting at each vertex; thus, all… … Wikipedia
Newton polygon — In mathematics, the Newton polygon is a tool for understanding the behaviour of polynomials over local fields. In the original case, the local field of interest was the field of formal Laurent series in the indeterminate X, i.e. the field of… … Wikipedia
Geographic information system — GIS redirects here. For other uses, see GIS (disambiguation). A geographic information system, geographical information science, or geospatial information studies is a system designed to capture, store, manipulate, analyze, manage, and present… … Wikipedia
Petrie polygon — In geometry, a Petrie polygon is a skew polygon such that every two consecutive sides (but no three) belong to a face of a regular polyhedron.This definition extends to higher regular polytopes. A Petrie polygon for an n polytope is a skew… … Wikipedia
Stellation — is a process of constructing new polygons (in two dimensions), new polyhedra in three dimensions, or, in general, new polytopes in n dimensions. The process consists of extending elements such as edges or face planes, usually in a symmetrical way … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
