基于Delaunay三角剖分的数字加网算法研究  

Algorithm Research about Digital Screening Based on Delaunay Triangulation

作　　者：刘春英[1] 王小华[1] 

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2008年第3期55-58,共4页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：该文提出了一种基于Delaunay三角剖分的数字加网算法,很好地解决了印花工艺中容易产生的莫尔花纹现象。该算法具有较高的求解效率,满足网屏的实时性生成,网点灰度值分布均匀,输出图像灰度分布准确柔和,并且对传统印花工艺设备及后续工序的要求不高,完全满足传统印花工艺的需求。The paper proposes an algorithm about digital screening based on Delaunay triangulation. The technology has solved Moire pattems phenomenon when printing in traditional pattem. The algorithm can give a real- time result for its high efficiency. Output image is accurate and soft for gray value distributes uniformly. It has a low request for equipment and subsequent handling, and entirely meet the needs of traditional printing technology.

关 键 词：半色调 莫尔花纹 三角剖分 数字加网 

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