摘要
并行扫描转换算法，采用通过多边形顶点的扫描线对扫描转换区间进行划分，使划分在各个区域的子多边形都是梯形，这既在一定区域内保持了各种相关性，又消除了对奇点的处理，同时对梯形的扫描转换不需要求交计算而只进行增量计算，提高了扫描转换速度。
In this paper, the scan-line across the vertices of polygon was used to divide the data set in the parallel scan-conversion filling algorithm on Mesh-Connected Computer (MCC). This can reduce the computation of intersect-point and eliminate the oddpoint on the node processors. This also maintains every coherence which is used to improve the process speed in sequence algorithm.
出处
《航空计算技术》
1998年第3期70-72,85,共4页
Aeronautical Computing Technique
关键词
网格结构
并行计算机
并行扫描转换
填充算法
Mesh-connected computer Parallel scan-line-convert filling algorithm
