1) crossing pair
交点对
1.
According to the definition of vertex, it divides three types of concave vertexcs ; Horizontal Vertex, Maximum Vertex and Turning Vertex, upon which it builds up a storage structure for their boundaries and establishes the concave-horizontal scan-color-lilling algorithm , ihns presenting a method to deal with the problem of a crossing pair" with one crossin.
并根据顶点类型定义,将凹多边形顶点分成“水平顶点”、“极点”、“拐点”三类,设计了基于三类顶点的边界存贮结构,建立了凹多边形水平扫描填色算法,解决了当交点为顶点时可能产生的“交点对”不配对的问题。
2) peer exchange
对等点交换
1.
Structure P2P routing algorithm based on peer exchange;
一种基于对等点交换的结构化P2P路由算法
3) Double of the odd and even intersecting point
奇-偶交点对
4) nonswitched point-to-point line
非交换点对点线
5) one-to-many node-disjoint paths
一对多点不交路
1.
In this paper, we consider the one-to-many node-disjoint paths problem and t-pairwise node- disjoint paths problem in Corn-Star graph.
本文解决了组合星图上一对多点不交路问题和t-对点不交路问题。
6) t-pairwise node-disjoint paths
t-对点不交路
补充资料：交点
【交点】
（杂语）彼此相共交接而点检也。见象器笺十二。
（杂语）彼此相共交接而点检也。见象器笺十二。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条