vertexes信息详情
n.顶点（vertex的复数）
advertise on bing───在bing上做广告
diverticular dx───憩室dx
subvert it───颠覆它
converting businesses───转换业务
averted means───避免的手段
overthrowing zeus───推翻宙斯
coreopsis verticillata───流形白鲑
converted car───改装车
diverticular disease symptoms───憩室病症状
controvertible def───有争议的定义
Takes all vertexes as initial population.───采用全部顶点做初始种群。
I then had to consider how to index the vertexes.───我当时不得不考虑如何索引的顶点。
mapping simplex method"is used instead of the "substitution of simplex vertexes".───用“映射单纯形”方法代替“单纯形顶点代换”方法；
In contact with the number of cut vertexes of a graph, this paper studies the lower boundary of maximum genus and receives some new results.───本文联系着图的割点数，研究图的最大亏格下界，得到了一些新的结果。
The mismatched vertexes are deleted gradually from the searching space, therefore the complexity of the algorithm is reduced significantly.───在算法运行过程中，通过不断地删除搜索空间中的非匹配顶点，大大地降低了算法的时空复杂度。
Traditionally, surface reconstruction is built directly by using reconstruction data, which control vertexes aren't compressed.───传统的逆向工程曲面重构方法是直接重构，即不对控制顶点进行压缩，直接利用重构数据。
Finally the rectangles' four vertexes coordinate through geometric constraints are solved.───最后利用几何约束求解出矩形模式特征的四个顶点。
This paper establishes the visualization model of location error for the random polyline which is composed by a sequence random vertexes .───本文针对由随机折线点构成的折线要素建立了一种可视化误差模型。
The object can be seen as a simple polygon of N vertexes.───物体能被视为一个N顶点的简单多角形。
Based on homogeneous barycentric coordinates, a new geometric variable, sharpness factor, is defined for measuring sharpness of independent vertexes.
Using Wide-Deep-Firstly searching, and Tarjan's graph partition algorithm the connection matrix between two vertexes is gotten.
Incidence degree sequence method considers vertexes and edges in the graph, gives attention to topology relationship matching and engineering data matching.
To automatically search key vertexes of train flow lines in a train flow diagram, its components and characteristics were analyzed based on graph theory.
Before cutting, the algorithm projects the vertexes in the tetrahedron under cutting to cut plane, this make the mesh easy for cutting.
Depending on the special relationship between vertexes and their center in a regular polygon a projective invariance is formed to extract the rotational center of object.
Wireless sensor network could be described as an undirected graph. The convergence degree of the node was determined by the ratio of the number of sub-graph's vertexes and number of the edges.
Select all vertexes and go to the command FILLET . This will round your sharp corners.
Narrowband watermarking information is spread into wideband pseudo-random code before being embedded by modifying the scale of the distance between vertexes in two-dimensional engineering graphics.