改进的NLN直线裁剪算法  

AN IMPROVED ALGORITHM OF NLN LINE - CLIPPING

作　　者：唐彩云[1] 万方杰[1] 岳春生[1] 

机构地区：[1]信息工程大学信息工程学院,郑州450002

出　　处：《计算机应用与软件》2002年第9期41-42,共2页Computer Applications and Software

摘　　要：NLN(Nicholl_Lee_Nicholl)裁剪算法的主要思想是通过在裁剪窗口周围划分多个区域来避免对一条直线多次裁剪及求交运算,但是仍存在不必要的求斜率的运算。本文提出依据裁剪线段两端点相对位置来划分窗口区域的方法,减少了求斜率的运算。算法的理论分析和在车载导航地图显示的实践运用都证实,改进是有效的。The main idea of the NLN line - clipping algorithm is to divide the window into several parts so as to avoid the unwanted clippings and operations. But there is no way yet to avoid the needless slope operations. According to the relative position of the two ends. A new method of dividing the window,which reduces the needless slope operations,is presented in this paper. The theory and the practice prove that this method is efEciently an improvement over the old one.

关 键 词：NLN直线裁剪算法 线裁剪 图形处理 计算机 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]