1) convex vertex
凹顶点
1.
This paper proposes an algorithm to divide an arbitrary polyhedron to tetrahedrons,which is based on our al-gorithm to decide its vertex s attribute of concave or convex,then searches the qualified convex vertex to be divided.
该算法的平均时间复杂度为O(N+M),其中N为多面体的凸顶点数目,M为多面体的凹顶点数目。
2) convex concave vertices
凹凸顶点
1.
Considering the triangulation algorithm based only on the determination of convex concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex concave vertices and connecting the outer border of a polygon with its inner borders.
针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点 ,提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法 GTP( General Triangulation of Polygons)。
2.
This paper presents a fast algorithm for Delaunay triangulation of simple polygon based on determination of convex concave vertices.
提出一种基于凹凸顶点判定的简单多边形Ｄｅｌａｕｎａｙ三角剖分算法。
3) convexo-concave vertices
顶点凹凸
4) concave-convex vertex of polygon
凸凹顶点
5) vertices convexity-concavity
顶点凹凸性
6) convexity-concavity of vertices
顶点凸凹性
1.
おhe internal relation between the orientation (clockwise or anti-clockwise) of polygon and the convexity-concavity of vertices is analysed.
本文深入剖析了平面简单多边形方向（逆时针或顺时针）与顶点凸凹性的内在本质联系，提出了确定顶点凸凹性的快速算法，并解决了根据凸点确定多边形方向的基本问题。
补充资料：凹模壁厚及凹模垫板尺寸
型腔壁部投影面积 壁 厚， 毫 米
F， 厘米2 h1 h2 h3 h4 h5
<5 15~20 30~40 <=10 15~20 30~40
>5~10 20~25 40~50 10~15 20~25 40~55
>10~50 20~30 50~60 15~20 20~30 55~65
>50~100 30~35 60~75 20~25 30~40 65~70
>100~200 35~40 75~85 25~30 40~50 70~75
>200 >40 >85 30~35 50~60 >80
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条