在中间层，可移植的图形引擎提供对线的绘制、区域的填充、多边形、裁剪以及颜色模型的支持。
At the middle level, a portable graphics engine provides support for line draws, area fills, polygons, clipping, and color models.
CanvasAPI是一个低级画图api，它支持创建直线、曲线、多边形和圆圈，并用彩色、渐变色等填充它们。
The Canvas API is a low level API for drawing. It lets you create lines, curves, polygons, and circles and fill them in with colors, gradients, and so on.
填充屏幕上的多边形区域。
但它的速度太慢，使用它创建快速多边形填充物。
提出了一种基于顶点存储类型的多边形填充算法。
This paper presents a new polygon filling algorithm based on vertex storage types.
利用前者填充边自相交的多边形区域需要做大量排序操作，这极大降低了填充效率；
But using the former to fill polygons with edge self-intersection needs large of taxes, affecting filling efficiency greatly.
本文详细描述了一种快速多边形填充算法——改进的边标志算法。
A fast polygon - filling algorithm named the improved edge flag algorithm is described in detail in this paper.
多边形点符自动填充是数字地图制图、电子地图制作和GIS中不可缺少的功能。
It is the basic function in the digital cartographic, electronic cartographic and GIS, the polygon be filled with point symbol.
缺省情况下，多边形填充模式是ALTERNATE，但是你可以设置它为WINDING。这两种模式之间的区别在图5 - 19中显示。
By default, the polygon-filling mode is ALTERNATE, but you can set it to WINDING. The difference between the two modes is shown in Figure 5-19.
本文就快速构成实体模型，提出一种有效的凸多边形填充算法。
An algorithm of filling convex polygon is provided in order to construct real-body model fast.
我用多边形套索工具来选出剖切面，然后使用油漆桶工具将选区填充为红色。
I used the polygonal tool to select the cut areas and used the paint bucket tool to fill the selections with red color.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
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.
多边形域填充是图形图像处理中最基本的操作之一。
The Polygon Area Fill is one of the import operators of the Computer Graphics and Image.
对多边形、椭圆和圆能够进行填充。
通过分析多边形轮廓的填充特点，提出了一种填充扫描矢量方向的优化方法。
Through analyzing the filling characteristics of polygonal contours, an optimization method of scanning vectors for filling sectional contours was presented.
文章提出通用扫描线多边形填充算法，该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。
This paper puts forward General scan-line polygon fill algorithm. This algorithm can use scan-lines of varied interval and varied slope to fill a polygon.
本文采用四叉树分割多边形，用以实现多边形的色彩填充及其相互之间的运算。
In this paper, The quadtree is adopted to divide polygons to realize color filling and calculation of polygons are also introduced.
创建使用当前多边形填充模式的两个或多个多边形，多边形可以相互分开或叠加。
Creates two or more polygons that are filled using the current polygon-filling mode. The polygons may be disjoint or they may overlap.
作者在对已有的多边形填充算法深入研究的基础上，给出了一种称之为“完全记忆求交法”的新的多边形填充算法。新算法较已有算法有更高的效率。
Base on the research for the algorithm, which have had, of filling up polygon, Authors give a new algorithm, to be known as "the algorithm to calculate points of intersection with completely memory".
边缘填充是一类多边形扫描转换算法，算法思路清晰，结构简单。
Edge filling algorithm is one of scan conversion algorithm. The thought of Edge filling is distinct and its structure is simple.
同时在对多边形填充过程中使用了凸包算法，解决确定多边形顶点顺序问题。
At the same time in the polygon filling process , the Graham algorithm is used to determine the polygon vertex order.
传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。
Traditional scan-line Polygon-Filling Algorithm can only deal with horizontal scan-lines and can only fill a polygon line by line.
本文提出了一种基于局部多边形的等值线跟踪和填充的算法。
This paper introduces an algorithm of contour tracing and rendering, which realizes contour tracing and contour rendering at the same time.
本文提出了一种基于局部多边形的等值线跟踪和填充的算法。
This paper introduces an algorithm of contour tracing and rendering, which realizes contour tracing and contour rendering at the same time.
应用推荐