摘要
文章提出一种新的直线逼近方法——类最佳逼近,基于这种逼近方法,斜率k∈[0,0.5)的直线和斜率为1-k的直线具有某种互补性质。利用该性质,设计出一种新的三步直线方法,该算法揭示了直线计算的互补性,理论简单,精度达到最好。最后比较了该算法和直线的双步算法,Brensenham算法,指出新算法改善了Bresenham算法和双步算法的计算效率。该算法对于硬件实现将更有益处。
The paper suggests a new linear approximation that is called quasi-best approximation, and then proves that the straight line of slope k∈[0, 0.5） is complement of the line of slope 1-k according to the approximation. Based the property, a new triph-step algorithm for straight line was constructed, which revealed the component property in line algorithm, and has relatively concise theory expression and best precise. Finally the paper compares the new algorithm with double-step and Bresenham＇s algorithm, and points out that new triple-step algorithm greatly improves the computing performance.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第6期30-33,共4页
Microelectronics & Computer
基金
广东省自然科学基金项目(5300374)
暨南大学自然科学基金项目(51204021)
