A new algorithm for finding the kernel of a simple polygon;
求解简单多边形核的新算法
Algorithm design and realization for decomposing simple polygon into convex parts;
简单多边形凸单元剖分算法的设计及实现
Algorithm for decomposing simple polygon into convex parts;
一个简单多边形凸单元剖分的算法
Three elements with rotational DOFs are presented, a 4-node quadrilateral element with two translational and a rotational DOFs per node,two 8-node hexahedron elements with three translational and three rotational DOFs per node.
本文提出了三个带转角自由度单元，其中一个平面四边形单元，两个空间六面体单元。
A new quadrilateral element with rotational degree of freedom at each corner is conformed from twelve node isoparametric element in this paper.
从具有三次位移模式的平面等参元出发 ,通过对单元自由度进行线性变换并引入连续介质力学中关于旋转度的定义 ,构造出角结点有旋转自由度的高精度四边形单元。
The initial mesh may be made of entirely triangular elements or may consist of a mixture of triangular and quadrilateral elements.
提出一种适用于汽车覆盖件曲面有限元网格转化和在单元水平上提高模拟精度的方法,将平面下通过合并三角形单元成四边形单元的有限元网格转换方法的应用范围扩展到曲面,并且降低了对初始网格形状的要求。
An algorithm is presented for computing a convex hull of the vertices of a simple polygonal line.
提出一种计算简单多边形链顶点凸壳的算法 ,基本思想是分段计算 ,在每段的计算中 ,先分 4种不同情况计算出边链 L1 ,然后利用一种技巧将 L1 上的部分顶点排列成顶点角递增序列 ,构成边链 L2 ,最后对 L2 进行倒查 ,删去非凸壳顶点 ,剩下的点即凸壳顶点 。
how to connect n line segments in the plane into a simple polygon or a simple polygonal line.
提出一个实际问题,即如何连接平面上n条线段成一简单多边形或者简单多边形链,并证明了连接平面上线段集S成一简单多边形链的一个充分条件:S中有一条线段连接凸壳CH(S)中不相邻顶点。
Sufficient condition to connect line segment set S in the plane into a simple polygonal line is proved.
提出一个如何连接平面上 n条线段成一简单多边形或者简单多边形链的实际问题 ,并证明了连接平面上线段集 S成一简单多边形链的一个充分条件—— S中有一条线段连接凸壳 CH(S)中不相邻顶点 。
Algorithm for decomposing simple polygon into convex parts
一个简单多边形凸单元剖分的算法
An effective algorithm of dividing plane simple polygon
一种分割平面简单多边形的高效算法
A convex decomposition algorithm of simple polygon based on its adjacent concave point connection;
基于简单多边形相邻凹点关系的凸剖分算法
Algorithm for Delaunay triangulation of simple polygon based on minimum distance
基于最小距离简单多边形的Delaunay三角剖分算法
New algorithm for determining position relation between simple polygon and point
判断点与简单多边形位置关系的新算法
Based on constructing convex polygon by extremity vertices and computing cross products of polygon's edge vectors, an algorithm for automatic identifying the orientation, convexity concavity of a simply polygon is proposed.
提出一种基于极值顶点构造凸多边形和矢量叉乘的自动识别简单多边形方向性、凸凹性的算法 .
Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.
简单多边形凸单元剖分是计算几何的基本问题之一，剖分算法在许多领域均有较广泛的应用。
The frequency polygon is simpler than its histogram counterpart.
频率多边形比直方图更简单。
Graph Model of Polygon Clipping Using Simple Vector Data
简单矢量数据多边形裁剪问题的图模型
The grains take on simple polygonal.
颗粒呈简单的多角形。
Improved ray method to judge the relation of point and polygon including simple curve
射线法判断点与包含简单曲线多边形关系的完善
In computer graphics, the simple function for drawing on the screen. Typical primitives are rectangle, line, polygon, etc.
在计算机图形学中，在荧光屏上绘图的简单程序。典型的图元是长方块、线段、多边形等。
Online Algorithm of Representation for Time-series Based on Polygonal Boundary Reduction Method
基于多边形边界约简的在线时序表示算法
First of all we could clip the polygon against the cube, which is simple, because of the axis aligned boundarys.
首先我们可以沿着立方体剪切这个多边形，这也是很简单的，因为（方体的）界是与坐标轴对齐的。
The control points of the rational spline to be constructed were computed simply by the vertices of the given polygon.
在算法中，所有的有理样条曲线的控制点可以通过对多边形的顶点简单计算产生。
It is possible to perform simple arithmetic operations on the contents of the stencil buffer on a per-pixel basis as polygons are rendered.
在绘制多边形时可以对模板缓存中的数组做逐像素的简单算术操作。
Study on Polygonal Simplification Algorithms with Texture Features;
结合纹理特征的多边形模型简化算法研究
Research on Simplification and Aggregation Algorithm of Island Polygon in Electronic Chart
电子海图岛屿多边形简化与合并算法研究
