查询词典 polygon

Vector to raster: Inside point diffuse method, diffuse from internal seeds within polygon to neighbor points, as far as to the boundary of polygon; Pluralism integral arithmetic, according to the close boundary of polygon, makes uncertain point calculate pluralism integral; Radial and scanning arithmetic, from a uncertain point which located outside of the figure to draw radial, according to the junction of radial and polygon to judge the internal and outside relationship; Boundary algebra filling, a vector convert to raster arithmetic which based on integral thought, suit for polygon vector convert which recorded topological relationship.

矢量转栅格：内部点扩散法，即由多边形内部种子点向周围邻点扩散，直至到达各边界为止；复数积分算法，即由待判别点对多边形的封闭边界计算复数积分，来判断两者关系；射线算法和扫描算法，即由图外某点向待判点引射线，通过射线与多边形边界交点数来判断内外关系；边界代数算法，是一种基于积分思想的矢量转栅格算法，适合于记

Raster Polygon can not only optimize Gerber to accelerate speed of file manipulation but also can give an exactly description on image better than vector polygon. It became a best replacement solution for vector polygon. UltraVision AOI can support Raster Polygon and also can avoid distortion caused by raster when revolute to Vector.

光栅式多边形填充不仅能够优化Gerber文件从而提高文件处理速度，并且比矢量式多边形填充更能对图形进行准确的描述，是后者的最佳代替方案，UltraVision AOI支持光栅式多边形填充，最大程度的避免因光栅转换成矢量而产生的图形失真。

A new polygon filling method——polygon trapezoidal decomposition filling method——is put forward and realized. An analytical comparing between its time complexity and that of the classical methods shows that it is faster than scan-line algorithm in the case of complex concave polygon.

提出了一条新的多边形填充思路——多边形梯形网格剖分填充法，实现了该算法并将其时间复杂度与经典的有序边表算法进行了比较，说明该方法在复杂的凹多边形情况下处理速度较有序边表快。

By decomposing each polygon into a set of several individual convex sub-polygons and constructing the map between the two sets, this method can solve the metamorphosis problem of two polygons which have not same topology(including concave polygon and holey polygon).

解决了任意非同拓扑结构的变形问题。

With the new method, a simplified polygon can obtained following two steps, filleting the original polygon and transforming the filleted shape to a polygon.

这种方法先对原多边形进行弧化，然后将弧化后的模型还原为直线边界的多边形，就得到了简化的图形。

Linear shift code, known polygon vertex coordinates, can be the edge of the polygon shift its normal direction and then get a new polygon from the vertex.

详细说明：直线偏移代码，已知多边形顶点坐标，可以将多边形各边沿其法线方向平移距离然后得到新的多边形顶点。

When the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of these edges, a new algorithm for computing the convex hull of a simple polygon is proposed first, which is then extended to a new algorithm for computing the convex hull of a planar point set.

本文依据凸多边形的这一特性，提出求解简单多边形凸包的新算法，进而扩展得到求解平面点集凸包的新算法。新点集凸包算法先找到点集的极值点，得到极值点间的候选点子集，再求得相邻极值点间的有序凸包点列，最后顺序连接极值点间的有序凸包点列，得到凸包。

This program can draw any polygon that is a \"regular polygon\", a \"star polygon\" or a \"star figure\". The code for the program is very simple and straight forward and the results ar...

简单的函数绘图语言编写一个解释器语法分析部分源代码语法分析的输入是在黑屏幕下输入text.txt，然后看运行结果。

Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly. New algorithms for orientation and inclusion test for simple polygon are proposed. And Ghosh's convex hull algorithms for simple polygon and convex polygons, Subramanian's triangulation algorithm for arbitrary planar domain and O'Rourke's intersection algorithm for convex polygons are modified to make them more robust.

断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了Subramanian的平面多连通域的三角划分方法、Ghosh的多边形的凸包及多个多边形的凸包算法和O'Rourke的凸多边形的求交算法。

Coordinate sequence method is made up of the instruct information of polygon boundary x, y coordinate. It is the easiest polygon vector encoding method. The file structure of this method is easy, but because of the polygon boundary has stored two times, it will produce data redundancy, moreover, short of neighbor threshold information; Tree index encoding method make all the boundary points digitizing, store the coordinate sequence, connect the point index to boundary line, and then connect the line index to other polygons, so as to the tree index structure has came into being. It eliminates neighbor polygons boundary data redundancy problems; Topology structure encoding method is a method which by setting up a complete topology relationship structure, resolve the neighbor threshold and island information process problem. However, it makes arithmetic more complicated and makes database bigger.

坐标序列法是由多边形边界的x，y坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。

Objective To study the effect of chitosan in the prevention of fibrous scar formation in the epidural space after laminectomy.

目的 观察选择性脊神经后根切除术椎板切除后硬膜外几种防瘢痕粘连物质的作用并探讨其机制。

On his way to the lift, he looked back to us or was it me his eyes pointing?

当他要进电梯时，他回头看我们（或者说是我，他的眼光？