-
1 plane
I 1. [plein] noun1) (an aeroplane.) avião2) (a level or standard: Man is on a higher plane (of development) than the apes.) nível3) (in geometry, a flat surface.) plano2. verb(to move smoothly over the surface (of water etc).) planarII 1. [plein] noun(a carpenter's tool for making a level or smooth surface.) plaina2. verb(to make (a surface) level, smooth or lower by using a plane.) aplainarIII [plein] noun(a type of tree with broad leaves.) plátano* * *plane1[plein] n Bot plátano, sicômoro.————————plane2[plein] n 1 Geom plano. 2 superfície, nível. 3 avião. • vi 1 viajar de avião. 2 planar. • adj plano, raso, liso. plane of incidence Opt plano de incidência. plane of projection Geom plano de projeção. plane of sight Mil plano de mira.————————plane3[plein] n plaina, escarnador. • vt aplainar. circular plane plaina circular. grooving plane goivete fêmeo. jack plane plaina para desbastar. jointer plane garlopa. sash plane plaina de vidraceiro. smoothing plane cepilho. toothing plane plaina com ferro dentado. -
2 plane
I 1. [plein] noun1) (an aeroplane.) avião2) (a level or standard: Man is on a higher plane (of development) than the apes.) plano3) (in geometry, a flat surface.) plano2. verb(to move smoothly over the surface (of water etc).) planarII 1. [plein] noun(a carpenter's tool for making a level or smooth surface.) plaina2. verb(to make (a surface) level, smooth or lower by using a plane.) aplainarIII [plein] noun(a type of tree with broad leaves.) plátano
См. также в других словарях:
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Planar array — In telecommunications and radar, a planar array is an antenna in which all of the elements, both active and parasitic, are in one plane. [A planar array provides a large aperture and may be used for directional beam control by varying the… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
H tree — Not to be confused with Htree, a Linux filesystem indexing structure. The first ten levels of an H tree The H tree (so called because its first two steps resemble the letter H ) is a family of fractal sets whose Hausdorff dimension is equal to 2 … Wikipedia
Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… … Wikipedia
Recursive tree — In graph theory, a discipline within mathematics, a recursive tree is a non planar labeled rooted tree. A size n recursive tree is labeled by distinct integers 1, 2, ..., n , where the labels are strictly increasing starting at the root labeled 1 … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
PQ tree — A PQ tree is a tree based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by… … Wikipedia
Kruskal's tree theorem — In mathematics, Kruskal s tree theorem states that the set of finite trees over a well quasi ordered set of labels is itself well quasi ordered (under homeomorphic embedding). The theorem was proved byharvs|txt=yes|year= 1960 |authorlink=Joseph… … Wikipedia
Théorème de Robertson-Seymour — En mathématiques, et plus précisément en théorie des graphes, le théorème de Robertson–Seymour (parfois également appelé le théorème des mineurs, et connu, avant qu il soit démontré, sous le nom de conjecture de Wagner), est un théorème démontré… … Wikipédia en Français