顶点

基本解释 (translations)

acme  ·  apex  ·  apogee  ·  crown  ·  culmination  ·  height  ·  maxima  ·  meridian  ·  peak  ·  peaks  ·  sublime  ·  sum  ·  summit  ·  ultimate  ·  vertex  ·  zenith  ·  capsheaf  ·  comble  ·  apexes  ·  crowns  ·  maximums  ·  sublimes  ·  sums  ·  vertexes  ·  floodtide  ·  heights  ·  max.  ·  meridians  ·  ultimates  ·  zeniths  ·  perfoot

词组短语

high point · meridian circle · crank point · sharp peak · top-out

与顶点相关的网络例句 [注：此内容来源于网络，仅供参考]

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures. The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort, and vertex adjacent list and triangle face adjacent list was established.

通过对STL文件的分析和几种常用数据结构的比较，给出了一种层次环状数据结构，该结构是由快速排序顶点序列进行冗余顶点滤除，并建立顶点邻接表和三角面片邻接表而得到的。

Furthermore,we present the method for designing quadratic Bezier developable surface:give four corner points of developable surface and two free designing parameters,the other two control vertexes are on the line connecting the linear interpolation point between the first two control vertexes and the linear interpolation point between the last two control vertexes,and they are the linear interpolation points between these two linear interpolation points respectively,namely,these four linear interpolation points are colinear.

提出了二次Bézier可展曲面的设计方法：给定可展曲面的4个角点a0、b0、a2、b2和两个自由设计参数？姿、？滋，则待求的2个控制顶点a1、b1是在前2个控制顶点a0、b0的线性插值点a*与后2个控制顶点a2、b2的线性插值点b*的连线上，并且也是a*、b*这2个线性插值点的线性插值，即这4点a*、a1、b1、b*共线。

This algorithm is proposed on the basis of the thought as follovvs: as for three dimensional Euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter.

如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。

These are called vertex focal distance because they are measured from the vertex of the lens surface to the lens focal point, The focal powers corresponding to them are the back and front vertex powers.

13从透镜的表面到焦点的距离被称为顶点焦距，是以透镜的前后顶点为起点测量的。与之相对应的屈光度称为前后顶点焦度。

In Microsoft DirectX 9.0, the HAL can have three different vertex processing modes: software vertex processing, hardware vertex processing, and mixed vertex processing on the same device.

在 Microsoft DirectX 9.0 中，HAL 有三种的顶点处理方式：软件顶点处理、硬件顶点处理和同一设备的混合顶点处理。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

A graph G is called*-choosable if for every list assignment L satisfying L=k for all v 6 V, there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself.

若对任一顶点给定k种颜色的列表，染色时每个顶点的颜色只能从自身的颜色列表中选择且每个顶点至多有d个邻点染相同的颜色，总存在图G的一个顶点的正常着色，则图G称为~*-可选色的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

当从第一个顶点到第二个顶点的方向表示该边所属三角形的逆时针方向时找到所有符合第一顶点的索引比第二个顶点索引小的边。

与顶点相关的网络解释 [注：此内容来源于网络，仅供参考]

developmental acme：发展顶点发展顶点

developmental acceleration 发展加速现象 | developmental acme 发展顶点发展顶点 | developmental age 发展年龄发展年龄

capstone：顶石, 压顶石, 顶点, (尤指成就的)顶点

capstan | 绞盘, 起锚机 | capstone | 顶石, 压顶石, 顶点, (尤指成就的)顶点 | capsula lentis | 晶状体囊

Vertex Chaos：顶点混乱度

Vertex捕捉到对象的顶点. 顶点;节点 | Vertex Chaos顶点混乱度 | Vertex Level顶点分类

initial vertex：初始顶点,起始顶点,始点

initial verification 初回検証 | initial vertex 初始顶点,起始顶点,始点 | initial void ratio 初始孔隙比,原始孔隙比

vertex of a polyhedral angle：多面角的顶点

vertex of a polygon 多边形的顶点 | vertex of a polyhedral angle 多面角的顶点 | vertex of a polyhedron 多面体的顶点

Impatiens balsamina 'Topknot Scarlet：顶点 猩红色 '顶点 猩红色'中国凤仙

204 中国凤仙 顶点 玫红色 '顶点 玫红色'中国凤仙 Impatiens bal... | 205 顶点 猩红色 '顶点 猩红色'中国凤仙 Impatiens balsamina 'Topknot Scarlet' | 206 顶点 紫罗兰色 '顶点 紫罗兰色'中国凤仙 Impatiens balsa...

Impatiens balsamina 'Topknot Rose：中国凤仙 顶点 玫红色 '顶点 玫红色'中国凤仙

203 星云 鲑鱼红色 '星云 鲑鱼红色'非洲凤仙 Impatiens waller... | 204 中国凤仙 顶点 玫红色 '顶点 玫红色'中国凤仙 Impatiens balsamina 'Topknot Rose' | 205 顶点 猩红色 '顶点 猩红色'中国凤仙 Impatiens balsa...

Impatiens balsamina 'Topknot White：顶点 白色 '顶点 白色'中国凤仙

206 顶点 紫罗兰色 '顶点 紫罗兰色'中国凤仙 Impatiens balsamina 'Topkno... | 207 顶点 白色 '顶点 白色'中国凤仙 Impatiens balsamina 'Topknot White' | 208 红苋 紫夫人 紫红色叶片 '紫夫人'红苋 Iresine 'Purpl...

Impatiens balsamina 'Topknot Violet：顶点 紫罗兰色 '顶点 紫罗兰色'中国凤仙

205 顶点 猩红色 '顶点 猩红色'中国凤仙 Impatiens balsamina 'T... | 206 顶点 紫罗兰色 '顶点 紫罗兰色'中国凤仙 Impatiens balsamina 'Topknot Violet' | 207 顶点 白色 '顶点 白色'中国凤仙 Impatiens balsamina ...

vertex of an angle：角的顶点

三角形的顶点 vertex of a triangle | 角的顶点 vertex of an angle | 顶点法 vertex scheme