英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

vertices    
vertex的复数形

vertex的复数形

vertices
顶点

Vertex \Ver"tex\, n.; pl. E. {Vertexes}, L. {Vertices}. [L.
vertex, -icis, a whirl, top of the head, top, summit, from
vertere to turn. See {Verse}, and cf. {Vortex}.]
A turning point; the principal or highest point; top; summit;
crown; apex. Specifically:
[1913 Webster]
(a) (Anat.) The top, or crown, of the head.
[1913 Webster]
(b) (Astron.) The zenith, or the point of the heavens
directly overhead.
[1913 Webster]
(c) (Math.) The point in any figure opposite to, and farthest
from, the base; the terminating point of some particular
line or lines in a figure or a curve; the top, or the
point opposite the base.
[1913 Webster]

Note: The principal vertex of a conic section is, in the
parabola, the vertex of the axis of the curve: in the
ellipse, either extremity of either axis, but usually
the left-hand vertex of the transverse axis; in the
hyperbola, either vertex, but usually the right-hand
vertex of the transverse axis.
[1913 Webster]

{Vertex of a curve} (Math.), the point in which the axis of
the curve intersects it.

{Vertex of an angle} (Math.), the point in which the sides of
the angle meet.

{Vertex of a solid}, or {Vertex of a surface of revolution}
(Math.), the point in which the axis pierces the surface.
[1913 Webster]


请选择你想看的字典辞典：
单词字典翻译
Vertices查看　Vertices　在百度字典中的解释百度英翻中〔查看〕
Vertices查看　Vertices　在Google字典中的解释Google英翻中〔查看〕
Vertices查看　Vertices　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • geometry - Orientation of a triangles vertices in 3D space: Clockwise . . .
    I would approach the issue from a completely different direction Consider a triangle in 3D with vertices at $\vec {v}_0$, $\vec {v}_1$, and $\vec {v}_2$ It has a directed normal $\vec {n}$, $$\vec {n} = \left (\vec {v}_1 - \vec {v}_0\right)\times\left (\vec {v}_2 - \vec {v}_0\right) \tag {1}\label {1}$$ If we look along $\vec {n}$ in one direction, the vertices are clockwise; in the opposite
  • Finding out the area of a triangle if the coordinates of the three . . .
    To get a formula where the vertices can be anywhere, just subtract the coordinates of the third vertex from the coordinates of the other two (translating the triangle) and then use the above formula
  • combinatorics - How many triangles can be formed by the vertices of a . . .
    Think about the vertices of the polygon as potential candidates for vertices of the triangle Using that, you get (n choose 3) as the number of possible triangles that can be formed by the vertices of a regular polygon of n sides
  • Online tool for making graphs (vertices and edges)?
    Anyone know of an online tool available for making graphs (as in graph theory - consisting of edges and vertices)? I have about 36 vertices and even more edges that I wish to draw (why do I have so many?
  • Proving that the number of vertices of odd degree in any graph G is . . .
    To prove that the number of odd vertices in a simple graph is always even, we can use the Handshaking Lemma, which states that the sum of the degrees of all vertices in a graph is twice the number of edges
  • Graph terminology: vertex, node, edge, arc - Mathematics Stack Exchange
    A cube has vertices and edges, and these form the vertex set and edge set of a graph At page 55 Remark 1 4 8 of the Second Edition: We often use the same names for corresponding concepts in the graph and digraph models Many authors replace "vertex" and "edge" with "node" and "arc" to discuss digraphs, but this obscures the analogies
  • How to calculate the number of possible connected simple graphs with $n . . .
    For Kn, there will be n vertices and (n (n-1)) 2 edges To determine how many subsets of edges a Kn graph will produce, consider the powerset as Brian M Scott stated in a previous comment If S is a finite set with n elements, then the powerset of S will have 2^n elements where n is the number of elements in the set S
  • Minimum distance from the vertices of a quadrilateral
    This is not an answer, but a visual comment The sum of the distances to the four points as a graph: This is somewhat reminiscent of 3D metaballs, an approach in computer graphics to produce organic-looking isosurfaces Compare to the graph describing the minimum distance to any of the four points: Both graphs are clipped to within the quadrilateral for simplicity
  • Drawing all non-isomorphic trees with $n = 5$ vertices.
    I followed the instructions in this question to create the trees for n = 1, n = 2, n = 3, n = 4, and n = 5 Note that I created rooted trees instead of free trees because it was easier You can get





中文字典-英文字典  2005-2009