This paper presents a new filling algorithm for vertex chain code.
该文提出一种填充算法，解决了顶点链编码表示区域的填充问题。
The paper analyzes two questions of the classical region filling algorithm.
首先分析了经典的区域填充算法的两个问题。
This paper presents a new polygon filling algorithm based on vertex storage types.
提出了一种基于顶点存储类型的多边形填充算法。
The paper proposed a region filling algorithm based on crack chain code description.
提出了一种基于缝隙码的区域填充算法。
In this paper an anisotropic hole filling algorithm for triangle mesh models is proposed.
提出一种用于三角网格模型的各向异性孔洞修补算法。
The filling algorithm brought forward independently by myself adapt to any data and any border.
该填充算法可适用于任意数据，任意边界的等值线填充。
Finally, automatic layout is implemented by utilizing "the lowest horizontal and filling algorithm".
最后用“最低水平线与填充算法相结合”策略的启发式排样算法实现自动排样。
A fast polygon - filling algorithm named the improved edge flag algorithm is described in detail in this paper.
本文详细描述了一种快速多边形填充算法——改进的边标志算法。
Filling algorithm of the complex connecting area is studied and a new scan line algorithm for filling area is presented.
对复连通区域填充算法进行了细致的研究，提出一种新的扫描线填充算法。
Edge filling algorithm is one of scan conversion algorithm. The thought of Edge filling is distinct and its structure is simple.
边缘填充是一类多边形扫描转换算法，算法思路清晰，结构简单。
Chapter 2 discusses a basic operation of image processing, i. e. region filling. A mended region filling algorithm is introduced.
第二章讨论图像和图形处理中的一个基本操作——区域填充，提出了一种改进的区域填充算法。
Traditional scan-line Polygon-Filling Algorithm can only deal with horizontal scan-lines and can only fill a polygon line by line.
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。
This article mainly introduces the pixel filling algorithm in pixel-processing-unit in CIG system and its FPGA realization technique.
主要介绍了CIG象素处理中象素填充的算法及其FPGA实现技术。
Filling algorithm for complex regions is studied to reduce the number of filling lines and improve the efficiency of laser processing.
为减少填充线段和提高激光加工效率，对复杂区域的填充算法进行了研究。
This algorithm can be used to fill in any desired region and its filling efficiency is close to that of standard rectangle filling algorithm.
该算法可适用于任意形状区域的填充，且在填充效率上非常接近仅适用于矩形区域填充的标准矩形填充算法。
In order to fill contours fast and conveniently, a new automatic filling algorithm between contours based on triangulation irregular net was proposed.
为了快速方便地进行等值线自动填充，提出了一种基于不规则三角网的等值线自动填充算法。
This paper makes an analysis of the characteristics of vector linear symbol and its basic components in GIS field, and puts forward a general filling algorithm.
该文分析了GIS中矢量线状符号的特点与基本构成，提出了一种高效且通用的矢量线状符号的填充算法。
A hole filling algorithm based on contours information is presented, and it conquers the limitation of the conventional ones to recognize the hole region automatically.
为了克服传统填充算法无法自动识别孔洞区域的不足，提出了一种基于边界信息的孔洞填充算法。
This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
Since graphics clipping and region filling are needed in the chart display, the graphics clipping algorithm and region filling algorithm are designed according to the requirement of the chart display.
闭于比现无算法，依据海图现示的须要，设计实现了海图现示外的图形剪裁和区域挖充算法。
Compared with the normal algorithms, the new one is efficient in algorithm, simple in realization for scan filling of simple connected area and also applicable to the filling of the complex area.
对比传统单连通区域扫描线填充法，新方法算法效率高，实现简单，对复杂区域的填充同样适用。
The experimental results demonstrate that the algorithm is efficient for noise suppression and image gap filling. It can extract the motion human silhouettes from color image sequence in real time.
实验结果表明上述算法对噪声抑制和人体图像断裂处填充都是有效的，能够实时从彩色图像序列中分割出运动人体。
A novel edge - labeled algorithm for simple connected area scan filling is presented.
提出一种基于边界标注的单连通区域扫描线填充快速算法。
The problem of complex region filling is an obstacle for embroidery CAD's algorithm design.
复杂区域填充问题是刺绣CAD算法设计中的难点。
The algorithm simple principle, not from the relatively complex operation, high speed, and a simple point of judgement guarantee the accuracy of the filling.
该算法原理简单，而不是从相对复杂的操作，速度快，简单的判别点，保证了灌装精度。
An algorithm of filling convex polygon is provided in order to construct real-body model fast.
本文就快速构成实体模型，提出一种有效的凸多边形填充算法。
This paper talks about how to find the most precise way which makes the residual size minimal in all ways of filling a satchel, discusses convergent algorithm and compares the values.
在所有装包方案中，寻找一种最为精确的装包方案，使挎包剩余体积最小，本文就该问题的快速收敛算法进行探讨并与理论值进行比较。
This paper presents an improving algorithm for region filling of isograms.
本文提出了一种实现等值带彩色填充的改进算法。
This paper presents an improving algorithm for region filling of isograms.
本文提出了一种实现等值带彩色填充的改进算法。
应用推荐