首先给出测定水平、垂直和对角方向邻接对的算法。
First, algorithms are given for determining such adjacencies in the horizontal, vertical, and diagonal directions.
这些操作典型地需要检查线性八元树中诸八分体在三个主方向上的面邻接对。
These operations typically require the inspection of surface adjacency pairs of octants in three principal directions.
对每个处理后的多边形递归执行这个步骤,直到没有邻接多边形。
This repeats recursively for each new 'correct' polygon until no more neighboring polygons can be found.
应用推荐