- 更多网络例句与多边形相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The irrational function forms interpolation on a polygonal element with arbitrary nodal distribution was constructed by using mean value coordinates of polygonal elements.
本文采用多边形单元的平均值坐标，构造任意节点分布的多边形单元无理函数形式的插值函数，提出了一种求解微分方程边值问题的多边形有限元方法。
-
Secondly, some foundational arithmetic such as the division of concave polygon, the polygons boolean operation, the transform from circle to polygon, the pick-up of model top surface were designed particularly based on OpenGL.
然后，基于图形库OpenGL完成了包括凹多边形的分割、多边形的布尔运算、圆的多边形转化、模型上表面获取等基础算法；并针对已建模工艺设计了相应的仿真算法。
-
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.
提出了一条新的多边形填充思路——多边形梯形网格剖分填充法，实现了该算法并将其时间复杂度与经典的有序边表算法进行了比较，说明该方法在复杂的凹多边形情况下处理速度较有序边表快。
-
We have proposed an arithmetic of this kind to eliminate the vertex in a circling way,ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.
概述了平面多边形三角形剖分的各种算法，提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法，并给出了实例。
-
A new method of polygon metamorphosis based on morphology and general optimization is proposed in this paper.
通过对多边形的凸剖分，并建立2种不同多边形的凸子集映射，提出了一种全新的基于凸多边形变形的全局优化方法。
-
In the geometry compression approaches presented in this thesis, the representation of a polygonal mesh is divided into two parts: the first part is termed topology information, which refers to the connectivity of the vertices in the mesh; the second part is termed as geometry information, which refers to the vertex locations and other attributes including color, normal, texture coordinates etc.
在本文中，一个多边形网格的数据表示为两部分：第一部分叫做拓扑信息，指多边形网格顶点之间的连接关系；第二部分叫做几何信息，指多边形网格坐标、颜色、法向以及纹理坐标等几何属性。
-
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坐标对集合及说明信息组成，是最简单的一种多边形矢量编码法，文件结构简单，但多边形边界被存储两次产生数据冗余，而且缺少邻域信息；树状索引编码法是将所有边界点进行数字化，顺序存储坐标对，由点索引与边界线号相联系，以线索引与各多边形相联系，形成树状索引结构，消除了相邻多边形边界数据冗余问题；拓扑结构编码法是通过建立一个完整的拓扑关系结构，彻底解决邻域和岛状信息处理问题的方法，但增加了算法的复杂性和数据库的大小。
-
In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.
论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。
-
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
录拓扑关系的多边形矢量数据转换，方法是由多边形边界上某点开始，顺时针搜索边界线，上行时边界左侧具有相同行坐标的栅格减去某值，下行时边界左侧所有栅格点加上该值，边界搜索完毕之后即完成多边形的转换。关系，并表示成矢量格式边界线的过程。步骤包括：多边形边界提取，即使用高通滤波将栅格图像二值化；边界线追踪，即对每个弧段由一个节点向另一个节点搜索；拓扑关系生成和去处多余点及曲线圆滑。
- 更多网络解释与多边形相关的网络解释 [注：此内容来源于网络，仅供参考]
-
contains point：多边形+点,多边形要素类的每个要素的边界以内必须包含点层中至少一个点
牐2.must not have gaps:单要素类,连续连接的多边形区... | 牐3.contains point:多边形+点,多边形要素类的每个要素的边界以内必须包含点层中至少一个点 | 牐4.boundary must be covered by:多边形+线,多边形层的边界与...
-
contains point：多边形+点,多边形要素类的每个要素边界以内必须包含点层中至少一个点
must not have gaps:单要素类,连续连接的多边形区域中间... | contains point:多边形+点,多边形要素类的每个要素边界以内必须包含点层中至少一个点 | boundary must be covered by:多边形+线,多边形层的边界与线层重叠...
-
Extrude Face：伸展多边形面
split poly 分割多边形 | extrude face 伸展多边形面 | sub divide 细分网面;细分多边形
-
Frequency polygon：频数多边形;频率多边形
frequency distribution table 频数分布表 | frequency polygon 频数多边形;频率多边形 | frustum 平截头体
-
polygon：多边形
o 形状 (Shape) - 定义重影的形状.可以选取"圆"(Circle),"多边形"(Polygon) 或"软多边形"(Soft Polygon).多边形的形状为六边形,其拐角为尖角. 数量 (Number) - 定义重影的数量.重影数量的可选择范围是 1 到 20.
-
polygonal domain：多边形区域
polygonal curve 多边形曲线 | polygonal domain 多边形区域 | polygonal figure 多边形图
-
vector polygon：矢多边形, 矢量多边形
413. vector point function 矢量点函数 | 414. vector polygon 矢多边形, 矢量多边形 | 415. vector position 矢量位置
-
polygon meshes：多边形网格 多边形网面
polygon 多边形 多边形 | polygon meshes 多边形网格 多边形网面 | polygon window 多边形窗口 多边形视窗
-
polygon meshes：多边形网页表格 多边形网面
polygon 多边形 多边形 | polygon meshes 多边形网页表格 多边形网面 | polygon window 多边形窗口 多边形视窗
-
star polygon：星形多边形
星形多边形(Star polygon)指的是正非凸多边形,即边长相等的凹多边形或复杂多边形. 星形多边形的施莱夫利符号若为{p/q},表示此一星形多边形有p的角,每一个角都和次q的角相连. 因此{5/2}即代表的是五芒星.