1) monotone polygon
单调多边形
1.
Triangulate partitioning monotone polygon with Visual C~(++);
VisualC~(++)实现单调多边形三角剖分
2.
The algorithm makes convex partition of a polygon with holes using monotone chains,it includes three stages: the first one decomposes a polygon with holes into ordered monotone chains;the second one divides the original polygon with holes into monotone polygons through combinations and splits of ordered monotone chains;the third one partitions every monotone polygon into convex polygons.
该算法利用单调链对有内孔的多边形进行凸划分,包括3个步骤:首先将有孔多边形分解为有序单调链;其次通过组合和分裂单调链,逐次拆分出单调多边形;最后将单调多边形划分为凸多边形。
2) monotonous polygon
单调多边形
1.
For triangulation of planar region with inner loops, by classifying the vertices and edges, the planar region can be easily subdivided into monotonous polygons, of which the time complexity of triangulation is O(N) .
提出一种平面区域三角化算法 ,通过对平面区域结点和边进行分类 ,不需插入新的结点 ,即可将平面区域转化为单调多边形 ,并给出单调多边形在O(N)时间开销下的三角化算法 ,从而大大提高了平面区域三角化的总体速
2.
The algorithm classified all the vertexes by its location characteristics,and sorted them along the appointed axis,and then selected the vertexes orderly to decide the creation,expansion or formation of a monotonous polygon by its type,at last triangulated the formative monotonous polygon.
多边形区域三角化的基本思想是:首先将简单多边形分解为多个单调多边形,然后对每个单调多边形进行三角化。
3) polygonal element
多边形单元
1.
Error estimation of Wachspress interpolation on polygonal elements;
多边形单元Wachspress插值的误差估计
2.
Applying a geometrical method to construct the shape functions of the polygonal element,a barycentric finite element method(BFEM) for solving elastic problems was presented.
采用几何法构造出任意边数多边形单元的重心插值形函数,应用Galerkin法提出了求解弹性力学问题的重心有限元方法。
3.
The irrational function forms interpolation on a polygonal element with arbitrary nodal distribution was constructed by using mean value coordinates of polygonal elements.
本文采用多边形单元的平均值坐标,构造任意节点分布的多边形单元无理函数形式的插值函数,提出了一种求解微分方程边值问题的多边形有限元方法。
4) simple polygon
简单多边形
1.
A new algorithm for finding the kernel of a simple polygon;
求解简单多边形核的新算法
2.
Algorithm design and realization for decomposing simple polygon into convex parts;
简单多边形凸单元剖分算法的设计及实现
3.
Algorithm for decomposing simple polygon into convex parts;
一个简单多边形凸单元剖分的算法
5) polygonal finite element method
多边形单元
1.
A novel polygonal finite element method(PFEM),which is based on partition of unity,was proposed and named as virtual node method(VNM).
因为虚节点法能适应任意边数的多边形单元,所以对网格具有很强的适应性,在几何条件复杂、网格生成困难的问题中具有良好的应用价值。
6) plain polygons
单纯多边形
补充资料：凹多边形
Image:11534686683212413.jpg
凹多边形
把一个各边不自交的多边形任意一边向两方无限延长成为一直线，如果多边形的其他各边不在此直线的同旁，那么这个多边形就叫做凹多边形。
凹多边形的内角和的解，其实我们可以通过（n-2）·180来计算。实际上是把大于平角的角划分为两个角（如图）
说明：补充资料仅用于学习参考，请勿用于其它任何用途。