面向屏幕水印的双屏最小完全覆盖算法  

Dual-screen Minimum Complete Coverage Algorithm for Screen Watermarking

作　　者：朱永超 雷浩 ZHU Yong-chao;LEI Hao(Department of Avic Chengdu Aircraft Industrial(Group)Co.,Ltd.,Chengdu 610031,China)

机构地区：[1]成都飞机工业(集团)有限责任公司,四川成都610031

出　　处：《软件导刊》2022年第10期217-224,共8页Software Guide

摘　　要：为提升屏幕水印软件的显示效率,增强软件适应性,对双屏最小完全覆盖问题进行研究。通过坐标化不同排列顺序和分辨率的双屏组合,分析相对位置分布规律,提出3种不同的双屏完全覆盖算法。结合每种算法在不同双屏组合下的显示效率,并通过抽象建模得到每种算法的显示效率计算公式,最终得出左右上下分屏算法为双屏最小完全覆盖算法。双屏最小完全覆盖算法的研究,可为多屏最小完全覆盖的实现提供参考。In order to improve the display efficiency of screen watermarking software and enhance the software adaptability,study the problem of minimum complete coverage of dual screens. By coordinating dual-screen combinations with different arrangement sequences and resolutions,analyzing the relative position distribution law,three different dual-screen complete coverage algorithms are proposed. Combined with the display efficiency of each algorithm under different dual-screen combinations,and through abstract modeling,the display efficiency calculation formula of each algorithm is obtained,and finally the left-right,upper-lower,upper-left,upper-left,left-right split-screen algorithm is a dual-screen minimum complete coverage algorithm. The research on the dual-screen minimum and complete coverage algorithm provides a reference for the realization of the multi-screen minimum and complete coverage.

关 键 词：屏幕水印 双屏显示 完全覆盖 最小覆盖 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]