查询词典 concave polygon

In this system,the VVVF(variable voltage variable frequency) control method based on magnetic flux trajectory is applied.In the system,it is the target for the magnetic flux linkage polygon to be greatly approximate to the ideal magnetic flux circle.Considering such limitations as the low speed torque ripple,high speed real time and the working frequency of switching element,through the subsection synchronization control method by applying different numbers of magnetic flux linkage polygon for different frequency range,the perfect precision specifications for speed can be obtained.

系统采用基于磁通轨迹法的他控式变频调速方案，以磁链多边形尽量逼近理想磁通圆为目标，并考虑低速转矩脉动、高速实时性和开关元件的工作频率限制等约束条件，通过采用分段同步控制方式，在不同的频段采用不同的磁链多边形边数，使系统获得了优异的转速精度指标。

Compared with traditional DEM or TIN based methods, this pure vector approach obtains not only the topological structure of drainage system in planar graph, but also the valley distribution polygon range. Depending on geometrical computation and judgment of vector line, polygon, the structured properties in drainage representation is enhanced, avoiding the case of noise disturbance in DEM based method. The core algorithm makes use of the ability of Delaunay triangulation in detecting hierarchical structure of each contour line.

中文摘要：基于Delaunay三角网模型在矢量等高线基础上通过弯曲特征分析，给出了一种地形结构特征提取及谷地树组织的方法，与传统的基于DEM或TIN数据结构提取地形特征的方法相比，该方法不仅得到了谷地系统在平面图上的拓扑结构，还获得了河谷在空间分布上的汇水范围，依托矢量线、多边形的几何关系判断，增强了谷地树组织中的结构化，避免了DEM方法中的噪音干扰，方法的核心是Delaunay三角网在单根等高线弯曲深度表达上的层次结构识别。

Furthermore, all arrays used to hold the line and polygon coordinates are allocated dynamically so the only limit on the number of polygon vertices and intersecting lines is the amount of available memory.

此外，所有数组用于保存线和多边形的坐标是动态分配的，因此对多边形的顶点数目只会限制和交叉线，是可用内存量。

To analyze the different locations of the intersection of a ray and a polygon quickly, a scheme of calculating the number for the intersection point is established based on the structure query language and the method of weighting each side of the polygon.

采用对多边形各边赋权值的方法，分析射线与多边形相交的不同情况，给出了使用结构化查询语言实现交点个数求解的快速解决方案。

OpenGl写code-Polygon fill algorithm can be used for any polygon filling, they know only the sentinel coordinates on the line.

多边形的填充，算法可用于任何多边形的填充，只需知道它们的定点坐标就行。

In this paper,using mean value coordinates of polygon in computer graphics,the mean value interpolation method setting vertexes of polygon as interpolating nodes is presented.

采用计算机图形学中的多边形平均值坐标，构造出以多边形顶点为插值节点的无理函数插值方法。

Firstly,3D point clouds produced by 3D laser scanner are converted into polygon mesh.Then,normal vectors and areas of every polygon mesh are computed and some candidate regions are obtained using region dilation strategy.Finally,the 3D laser scanning data is segmented into regions of similar orientation after the elimination of the insignificant regions.

首先将三维扫描表面数据转化为三维网格模型；然后利用同一区域中相邻网格具有相似法线方向这一性质，使用区域膨胀策略生成若干获选表面区域；最后通过去除候选区域中的噪声区域得到最终表面区域分割结果。

The corners of each new polygon are at the intersections of the borders of the original polygons; hence computing the coordinates of border intersections is a vital function in polygon overlay.

每个新的多边形的角隅都位在原始的多边形的边之交叉点上；因此，计算这些交叉点的座标在多边形的叠合中是绝对必要的。

Polygon scan conversion raster graphics through the realization of the classic polygon filling algorithm, raster graphics, in-depth un...

多边形扫描转换通过实现光栅图形学经典的多边形填充算法，深入理解光栅图形学的原理。

Polygon scan conversion raster graphics through the realization of the classic polygon filling algorithm, raster graphics, in-depth understanding of the principle.

详细说明：多边形扫描转换通过实现光栅图形学经典的多边形填充算法，深入理解光栅图形学的原理。

Green function defined inphase space differs from one in coordinate space by its struc-ture which exhibits nonlocatity in coordinates and oscillatorybehavior with respect to momenta.

在相空间中定义的Green函数不同于通常坐标空间的Green函数，在结构上显示出对坐标的高度非局域性，而对动量则显示出振荡行为。

The upper front part of a saddle;a saddlebow.

前鞍桥马鞍前面的上部分；前鞍桥