1.【几】顶(点);【解】颅顶,头顶;【天】天顶
2.顶(点),绝顶
1.the point that is opposite the base of a triangle; the point where two lines join at an angle
2.the highest point of something
1.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.
本文联系着图的割点数，研究图的最大亏格下界，得到了一些新的结果。
2.The mismatched vertexes are deleted gradually from the searching space, therefore the complexity of the algorithm is reduced significantly.
在算法运行过程中，通过不断地删除搜索空间中的非匹配顶点，大大地降低了算法的时空复杂度。
3.Traditionally, surface reconstruction is built directly by using reconstruction data, which control vertexes aren't compressed.
传统的逆向工程曲面重构方法是直接重构，即不对控制顶点进行压缩，直接利用重构数据。
4.Finally the rectangles' four vertexes coordinate through geometric constraints are solved.
最后利用几何约束求解出矩形模式特征的四个顶点。
5.This paper establishes the visualization model of location error for the random polyline which is composed by a sequence random vertexes .
本文针对由随机折线点构成的折线要素建立了一种可视化误差模型。
6.The object can be seen as a simple polygon of N vertexes.
物体能被视为一个N顶点的简单多角形。
7.Beginning from eliminating the influence of T- vertexes around shadow boundary, this paper proposed a new meshing algorithm.
本文从消除T型结点对图形计算的负面影响入手，提出了一种新的快速网格化算法。
8.Then, we obtain the smoothed vertexes of the curve by solving an objective function under the constraint of the two angle sequences.
然后以去噪后的角度作为一个约束条件，构造目标函数来反求曲线的顶点。
9.Currently, algorithms based on graph cut take pixels as vertexes, therefore, real-time of segmentation is poor.
由于加权图的顶点规模较大，因此分割实时性较差。
10.Select the segments of the line and add the more vertexes . Then add more lines to complete the spiderweb.
选择这些线的片段并加入更多的顶点。然后加入更多的线来完成蜘蛛网。