查询词典 adjacent

The CDXUTMesh10::ConvertToAdjacencyIndices handles this by creating an index buffer in which every other value is the index of the adjacent vertex of the triangle that shares an edge with the current triangle.

CDXUTMesh10：：ConvertToAdjacencyIndices做了这个操作，在这个Index Buffer中，每个其他的值代表和这个三角形共享边的其他三角形的Index。

Nelder and Mead also resolved the question of what to do if none of the steps tried bring acceptable improvement by adding a shrink step: when all else fails, reduce the lengths of the edges adjacent to the current best vertex by half, as is also illustrated in Fig.

Nelder 和 Mead同时也解决了如果增加一个缩小步长没有一个尝试步长是可接受的改进怎么办的问题：如果都失败，将与当前最好顶点相连的边减半，正如图3所示。

In the fourth chapter, we shall determine the adjacent vertex distinguishing incidence chromatic number of complete bipartite graphs, C_m,·F_n graphs and one type ofθ- graph.

在第四章中我们将确定完全二部图、C_m·F_n图及一类θ-图的邻点可区别关联色数。

So far, just have the adjacent vertex distinguishing total chromatic number of graphs such as path, cycle, tree, complete graphs, etc.

由于这种染色有一定难度，目前涉及到的文献极少，仅知路、圈、树、完全图等几类图的邻点可区别全色数。

A pebbling move on a graph G consists of taking two pebbles off from a vertex and placing one pebble on an adjacent vertex.

在图上进行小石块的移动的步骤为从一个点上取走两个小石块，并在它的某个邻点上放一个小石块。

Then we used Kriging interpolation technique in geological statistics to establish geological graphics model,and presented the method of searching known sample points in the region to be interpolated adjacent to triangle mesh vertex with"polygon"expanding,and the method of dealing with the impact of boundary and faultage on interpolated results by distance revolving.

首先给出限制条件下的区域Delaunay剖分原理；其次采用了地质统计学中的克里金插值技术建立图件模型，提出了"多边形"扩张法搜索待插值三角网格顶点邻域内的已知采样点，以"距离环绕法"处理了断层和边界对插值结果造成的影响；结合地质图件自动建立过程；最后给出了一个具体的应用实例。

The "Prufer" code of such a tree is built as follows: the leaf (a vertex that is incident to only one edge) with the minimal number is taken. This leaf, together with its incident edge is removed from the graph, while the number of the vertex that was adjacent to the leaf is written down.

从题目描述我们可以知道，对于一棵树，每次都找到编号最小的叶子结点，然后输出它的双亲结点的编号作为 Prufer Code，同时删除这个最小的叶子结点为下一次输出 Prufer Code 做准备。

We shall determine the adjacent vertex distinguishing incidence chromatic number of paths, cycles, stars, fans, wheels, complete graphs.

我们将确定路、圈、星、扇、轮、完全图的邻点可区别关联色数。

However, they can be adjacent.

然而，他们可以相邻。

The aim of the game is to get as many points as you can by swapping two adjacent items.

的目的，游戏是让尽量多的分，你可以通过交换两个相邻的项目

I was up all night because I was in pain, she said.

我整夜，因为我在疼痛，她说。

A crow caws /craoks.

乌鸦叫。 51-论文网