八叉树不易表达场景的相邻结点，本文设计了邻域查找算法以进行八叉树中相邻结点的查询。
In view of that the octree is not easy to express the adjacent nodes, we design a neighborhood search algorithms for querying the adjacent nodes.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
主链上弹性PB D段通过多个联结点与相邻的PS微区连接，提高了弹性体的性能。
The elastic PBD blocks of the backbone bridge adjacent PS domains through multiple junction points, resulting in the enhanced elastomeric properties.
应用推荐