一种关于图形拼接的算法  

AN ALGORITHM ON GRAPHIC JOINING

作　　者：文化[1] 王明江[1] 唐璞山[1] 

机构地区：[1]复旦大学电子工程系,上海200433

出　　处：《计算机应用与软件》2000年第2期26-29,共4页Computer Applications and Software

摘　　要：现代工程技术的发展,使它涉及的对象系统越来越大,为了对一个规模很大的系统结构图像进行研究,通常要借助于计算机工具。而为了将庞大的结构图像输入,我们可以将其拆散成各个局部的结构图,用一定的辅助工具(如扫描仪)等分别送入,而在计算机内部就存在如何将其还原的问题,我们在这里为解决这个问题提出了一种有指导性的自动拼接算法。A companying the development of modem technology, researchers are forced to face large systems with more and more objects. In order to study the structure of a very large scale system, we usually take advantage of computers. To input the large scale structure graphics, we can divide the whole diagram into a lot of small pieces. By a certain auxiliary device (such as scanner) ,we can input these small pieces one by one. In the computer,we should join all these small pieces together and get a whole system structure diagram. How to do this, we suggestan algorithm to solve this problem.

关 键 词：图形拼接 算法 图形处理 计算机 

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