「vertex」の共起表現一覧(1語右で並び替え)
該当件数 : 601件
| alled an incidence list, which stores for each | vertex a list of objects representing the edges incid |
| be the equilateral triangle having base BC and | vertex A' on the negative side of BC and let AB'C and |
| Four years later, he founded | Vertex Academic Services, a test preparation provider |
| The | vertex addition method began with an inefficient O(n2 |
| Kac, Victor, | Vertex Algebras for Beginners, Second Edition, AMS 19 |
| In particular he invented the notion of | vertex algebras, which Igor Frenkel, James Lepowsky a |
| Corporation, Xanatos demands vast supplies of | Vertex, an expensive crystal worth high monetary valu |
| nguage that controlled the GPU pipeline for 3D | vertex and interpolated pixel properties, respectivel |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown with |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining golden brown, medially |
| bronze with greenish and reddish reflections, | vertex and neck tufts shining dark brown with reddish |
| chreous with greenish and reddish reflections, | vertex and neck tufts brown with reddish gloss, later |
| Head: frons shining pale ochreous, | vertex and neck tufts shining greyish brown, laterall |
| frons shining white with greenish reflection, | vertex and neck tufts shining greyish brown with redd |
| us-grey with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| own with greenish and reddish and reflections, | vertex and neck tufts brown with reddish gloss, media |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining greyish brown with redd |
| Head: frons shining pale ochreous, | vertex and neck tufts shining ochreous-brown, mediall |
| rey with greenish and reddish and reflections, | vertex and neck tufts dark bronze brown with reddish |
| f 24 octahedral cells with six meeting at each | vertex, and three at each edge. |
| ns shining pale grey with greenish reflection, | vertex and neck tufts bronze brown, posteriorly olive |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown, late |
| ining ochreous-white with greenish reflection, | vertex and neck tufts brown, narrowly lined white lat |
| y pale greyish brown with reddish reflections, | vertex and neck tufts dark greyish brown with greenis |
| shining greyish white with reddish reflection, | vertex and neck tufts shining bronze brown with reddi |
| h white with greenish and reddish reflections, | vertex and neck tufts dark brown with reddish gloss, |
| h white with greenish and reddish reflections, | vertex and neck tufts shining greyish brown with redd |
| Head: frons shining ochreous-grey, | vertex and neck tufts shining dark brown with a media |
| s-white with greenish and reddish reflections, | vertex and neck tufts dark brown with reddish gloss, |
| us-grey with greenish and reddish reflections, | vertex and neck tufts dark bronze brown, laterally an |
| s-white with greenish and reddish reflections, | vertex and neck tufts dark bronze brown with reddish |
| g white with greenish and reddish reflections, | vertex and neck tufts shining dark brown with reddish |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining dark bronze brown with |
| rey with greenish and reddish and reflections, | vertex and neck tufts shining dark bronze brown with |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown with |
| g pale ochreous-grey with greenish reflection, | vertex and neck tufts shining brown with reddish glos |
| Head: frons shining ochreous-white, | vertex and neck tufts shining greyish brown with some |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining ochreous-brown with red |
| us-grey with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| It cannot go in one lower | vertex and out the other. |
| hining greyish white with greenish reflection, | vertex and neck tufts shining dark olive brown, later |
| The algorithm begins by first examining each | vertex and adding the cheapest edge from that vertex |
| Head: frons shining pale golden metallic, | vertex and neck tufts shining dark bronze brown with |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| hining ochreous-white with reddish reflection, | vertex and neck tufts shining greyish brown with redd |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining dark brown with greenis |
| ales of the head are directed forward over the | vertex and down the frons. |
| re must contain equal numbers of both types of | vertex and must have an even length. |
| tive, because q has a length-zero edge to each | vertex and the shortest path can be no longer than th |
| form the clique graph, as is every set of one | vertex and every set of two adjacent vertices. |
| with a bridle of three lines connected to the | vertex and to the two ends of the quadrant's arc. |
| e, X consists of the two neighbors of a corner | vertex and has two X-flaps: one consisting of that co |
| face of the rhombic dodecahedron with a single | vertex and four triangles in a regular fashion one en |
| case, a DCEL contains a record for each edge, | vertex and face of the subdivision. |
| cle, a henagon is a tessellation with a single | vertex, and one 360 degree arc. |
| pecial for having all even number of edges per | vertex and form bisecting planes through the polyhedr |
| The language unifies | vertex and fragment processing in a single instructio |
| ollapsed into a point, losing one edge and one | vertex, and changing two squares into triangles. |
| } is composed of 3 coplanar pentagons around a | vertex and two perpendicular pentagons filling the ga |
| those in which one arrow points away from its | vertex and towards the opposite end, while the other |
| edge arrangement which means they have similar | vertex and edge arrangements, but may differ in their |
| of the two sides of the partition by a single | vertex, and recursively partitions these two subgraph |
| lling in new faces in the gaps for each opened | vertex and edge. |
| As a graph with one outgoing edge per | vertex and one root reachable by all other vertices, |
| lling in new faces in the gaps for each opened | vertex and edge. |
| In the beginning, | vertex and pixel shaders were programmed at a very lo |
| r the treatment of hepatitis C co-developed by | Vertex and Johnson & Johnson. |
| Expand the | vertex and save all of its successors in a stack |
| side located on one the faces containing that | vertex and opposite to it, are in the ratio √2:√3:√5. |
| h white with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with green |
| g pale ochreous-grey with greenish reflection, | vertex and neck tufts shining bronze brown with reddi |
| shining greyish white with golden reflection, | vertex and neck tufts shining dark bronze brown with |
| In mathematics, the polar sine of a | vertex angle of a polytope is defined as follows. |
| The median bisects the | vertex angle from which it is drawn only in the case |
| The | vertex angle is equal to |
| The polar sine of the | vertex angle is |
| Let A, B, C denote the | vertex angles of the reference triangle, and let x : |
| The telescope was designed and constructed by | VERTEX Antennentechnik GmbH (Germany), under contract |
| inite henagon can be drawn by placing a single | vertex anywhere on a great circle. |
| ently labeled if all of the edges leaving each | vertex are labeled in such a way that at each vertex, |
| opagator that connects back to its originating | vertex are often also referred as tadpoles. |
| uare pyramid is convex and the defects at each | vertex are each positive. |
| G as a switch graph in which the edges at each | vertex are partitioned into matched and unmatched edg |
| It shares its | vertex arrangement with the truncated great dodecahed |
| omposition of 5 octahemioctahedra, in the same | vertex arrangement as in the compound of 5 cuboctahed |
| The regular octahedron shares its edges and | vertex arrangement with one nonconvex uniform polyhed |
| It shares its | vertex arrangement with the great stellated truncated |
| It shares the same | vertex arrangement as the convex regular icosahedron. |
| It has the same | vertex arrangement as two other simple rhombic tiling |
| It shares its | vertex arrangement with the uniform compounds of 10 o |
| This polyhedron shares the | vertex arrangement with the stellated truncated hexah |
| It shares the same | vertex arrangement as the regular convex icosahedron. |
| This | vertex arrangement is called the A5 lattice or 5-simp |
| This | vertex arrangement or lattice is called the B4, D4, o |
| of the Stella octangula (which share the same | vertex arrangement of a cube). |
| It shares the | vertex arrangement with three other uniform polyhedra |
| It shares the same | vertex arrangement as a nonuniform truncated octahedr |
| It shares its | vertex arrangement with the regular dodecahedron, as |
| It shares its | vertex arrangement with the truncated great dodecahed |
| It shares its | vertex arrangement with three nonconvex uniform polyh |
| ion of 5 small rhombicuboctahedra, in the same | vertex arrangement (i.e. |
| It shares its | vertex arrangement with the truncated dodecahedron. |
| Its | vertex arrangement is called the D8 lattice. |
| It shares the | vertex arrangement with the convex truncated cube. |
| It has the same | vertex arrangement as the pentagonal antiprism. |
| Its | vertex arrangement is called the D6 lattice. |
| The 222 honeycomb's | vertex arrangement is called the E6 lattice. |
| Its | vertex arrangement is called the D7 lattice. |
| Its | vertex arrangement is called the E7 lattice. |
| It shares the same | vertex arrangement as a dodecahedron. |
| For example a square | vertex arrangement is understood to mean four points |
| e 10 for having 600 vertices, and has the same | vertex arrangement as the regular convex 120-cell. |
| It shares its | vertex arrangement with the compound of 6 pentagrammi |
| ition of 5 small cubicuboctahedra, in the same | vertex arrangement as the compound of 5 small rhombic |
| It shares the | vertex arrangement and edge arrangement with the cubo |
| It shares the | vertex arrangement with the convex truncated cube and |
| The | vertex arrangement is also shared with the compounds |
| The 12 vertices of the convex hull matches the | vertex arrangement of an icosahedron. |
| The | vertex arrangement of this compound is shared by a co |
| ample the pentagon and pentagram have the same | vertex arrangement, while the second connects alterna |
| Eight uniform star polyhedra share the same | vertex arrangement. |
| regiment (1-regiment) shares the same edge and | vertex arrangement. |
| ey are called star polygons and share the same | vertex arrangements of the convex regular polygons. |
| zonohedra are simple (three faces meet at each | vertex), as is the truncated small rhombicuboctahedro |
| as a single fan, by arbitrarily selecting one | vertex as the center. |
| o an angle measured from the zenith point (the | vertex) as seen by an observer by subtracting the par |
| If the two removed edges meet at a | vertex, as in Figure B, the remaining graph contains |
| quiring no arbitrary choice of side as base or | vertex as origin. |
| process a large number of times, selecting the | vertex at random on each iteration, and throwing out |
| matching in the grid graph formed by placing a | vertex at the center of each square of the region and |
| tance, this may be achieved by placing the ith | vertex at the point (i,i2,i3) of the moment curve. |
| The lower part is divided into three, with | vertex at the top, alternating gules and argent with |
| space, usually approximately conical with its | vertex at the antenna, that cannot be scanned by an a |
| t cycles, then every shortest path visits each | vertex at most once, so at step 3 no further improvem |
| rfect graphs (in every induced subgraph, every | vertex belongs to an independent set meeting all maxi |
| s-white with greenish and reddish reflections, | vertex bronze brown, neck tufts dark bronze brown wit |
| hich also has 3 triangles and two squares on a | vertex, but in a different order. |
| ls, five 5-cells, and one 16-cell meet at each | vertex, but the vertex figures have different symmetr |
| The graphs that may be built from a single | vertex by pendant vertices and true twins, without an |
| each such point of tangency with its opposite | vertex by a line (shown red in the figure), these thr |
| The graphs that may be built from a single | vertex by false twin and true twin operations, withou |
| If segments of lengths p and q emanating from | vertex C trisect the hypotenuse into segments of leng |
| Outside U3(3) let there be a 100th | vertex C, whose neighbors are the 36 168-subgroups. |
| The third edge from each | vertex can then be described by how many positions cl |
| on scattering has the advantage that the first | vertex can be cleanly described by the well known qua |
| The internal angle of the spherical digon | vertex can be any angle between 0 and 180 degrees. |
| d to red ones by any automorphism, but any red | vertex can be mapped on any other red vertex and any |
| acets in place of the original face, edge, and | vertex centers. |
| graph theory, an exact coloring is a (proper) | vertex coloring in which every pair of colors appears |
| subgraphs, the number of colors needed in any | vertex coloring is the same as the number of vertices |
| This formulation is equivalent to | vertex coloring the conflict graph of set R, i.e. a g |
| harmonious coloring in the sense that it is a | vertex coloring in which every pair of colors appears |
| cs, a star coloring of a graph G is a (proper) | vertex coloring in which every path on four vertices |
| theoretic terms, each colour class in a proper | vertex coloring forms an independent set, while each |
| raph theory, an acyclic coloring is a (proper) | vertex coloring in which every 2-chromatic subgraph i |
| coloring of a graph is almost always a proper | vertex coloring, namely a labelling of the graph's ve |
| In a proper | vertex coloring, the vertices are coloured such that |
| ine, defective coloring is a variant of proper | vertex coloring. |
| Hence, (k, 0)-coloring is equivalent to proper | vertex coloring. |
| This is different from (non-weak) | vertex coloring: there is no constant-time distribute |
| , for example, counts the number of its proper | vertex colorings. |
| The | vertex configuration is 3.8/3.8/3. |
| egular uniform polyhedra are listed with their | vertex configuration or their Uniform polyhedron inde |
| The | vertex configuration is 5.5/2.5.5/2. |
| The | vertex configuration is 6.5/2.6.5/3. |
| The | vertex configuration is 5.6.5/3.6. |
| For example, a | vertex configuration of (4,6,8) means that a square, |
| ar, specifically the trihexagonal tiling, with | vertex configuration (3.6)2. |
| Compare to trihexagonal tiling with | vertex configuration 3.6.3.6. |
| a | vertex configuration and [n,3] Coxeter group symmetry |
| 2-dimensional tilings, they can be given by a | vertex configuration listing the sequence of faces ar |
| Here the | vertex configuration refers to the type of regular po |
| on is thus uniform) it can be represented by a | vertex configuration notation sequencing the faces ar |
| semiregular solids can be fully specified by a | vertex configuration, a listing of the faces by numbe |
| f sequence of uniform truncated polyhedra with | vertex configurations (3.2n.2n), and [n,3] Coxeter gr |
| f sequence of uniform truncated polyhedra with | vertex configurations (3.2n.2n), and [n,3] Coxeter gr |
| Each | vertex contains 12 5-simplexes, 30 rectified 5-simple |
| pping each real x in the interval [0,1) to the | vertex corresponding to the first n digits in the bas |
| polytope Kn is a convex polytope in which each | vertex corresponds to a way of correctly inserting op |
| f vertices no two of which are adjacent, and a | vertex cover is a set of vertices that includes the e |
| A complete bipartite graph Km,n has a | vertex covering number of min{m,n} and an edge coveri |
| vertex covering number - the minimal number of vertic | |
| he theorem states that the size of the minimum | vertex cut for x and y (the minimum number of vertice |
| They are maximally connected as the only | vertex cut which disconnects the graph is the complet |
| In mathematics, a | vertex cycle cover (commonly called simply cycle cove |
| Head: frons shining ochreous-white, | vertex dark brown with reddish gloss, laterally and m |
| Vertex Data Science, GE-Aviation, Dowty Rotol, Chelse | |
| Vertex Data Science, GE-Aviation, Dowty Rotol, Chelse | |
| ongoing concerning spanners with either small | vertex degree or a small number of edges. |
| ning tree is a spanning tree where the maximum | vertex degree is limited to a certain constant k. |
| ts in the plane the NNG is a planar graph with | vertex degrees at most 6. |
| vertices such that each color class induces a | vertex disjoint union of cliques. |
| The algorithm finds a maximal set of | vertex disjoint augmenting paths of length k. |
| The problems of finding a | vertex disjoint and edge disjoint cycle covers with m |
| their normal prescription since the effect of | vertex distance is removed and the effect of center t |
| dra and tetrahedra can be alternated to form a | vertex, edge, and face-uniform tessellation of space, |
| two vertices embedded to the same point and no | vertex embedded into a point within an edge. |
| side resting on the Guadiana and the opposite | vertex entering south-east and surrounded by Spanish |
| s an undirected edge-labeled graph, where each | vertex enumerates its outgoing neighbors. |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
