在超级集群拓扑结构中，必须编辑这个静态路由信息来生成一个单一的扁平式集群，其中包含超级集群的所有成员。
In a super cluster topology, you must edit this static routing information to make a single flattened cluster that contains all of the members of the super cluster.
仿真结果表明，在生成树拓扑抽象中使用此逼近算法后，可大大减少源节点由于拓扑信息不准确而产生的路由决策错误数，提高网络性能。
Simulation results show that the proposed algorithm can greatly reduce the routing decision errors of the source nodes due to inaccurate topology information, and improve network performance.
本文通过分析遥感分类图栅格像元之间的关系，快速自动地提取矢量数据点及其连接信息，进而利用连接信息快速生成弧段，由弧段自动组建多边形并建立完整的拓扑关系。
In this paper, we analyzed the relations between pixel and pixel in the classified raster map. Based on the relations, all vector points and the connection information between them can be extracted.
本文通过分析遥感分类图栅格像元之间的关系，快速自动地提取矢量数据点及其连接信息，进而利用连接信息快速生成弧段，由弧段自动组建多边形并建立完整的拓扑关系。
In this paper, we analyzed the relations between pixel and pixel in the classified raster map. Based on the relations, all vector points and the connection information between them can be extracted.
应用推荐