凸多边形

提出了基于直线与凸多边形几何位置关系编码的一种新的凸多边形线裁剪算法，用凸n边形窗口对m条直线进行裁剪。

Based on the geometrical relationship between a line and a convex polygon , a new algorithm of line clipping against convex polygon window is established .

用凸多边形微量增长法求解TSP

Solving the TSP by Little Increasing Convex Polygon

CAD中确定平面凸多边形支撑线的一个实用算法

A Practical Algorithm of Determining Supporting Line sofa Plane Convex Polygonin CAD

凸多边形窗口的线裁剪是用多边形窗口裁剪多边形的基础.为此，提出了凸n边形窗口的线裁剪新算法。

A new algorithm of line clipping for convex polygons with n edges is proposed .

凸多边形单元上的样条Blending插值格式

Spline blending interpolation scheme over convex polygonal cells

对散布于平面上的任意点，必然构成边数为n的凸多边形点数m的猜想，提出另一种可能结果。

Another possibility to the guess that the number of the points interspersing among a plane that must form a protruding polygon having n margins ;

本文采用OpenGL作为特征造型系统的API，对非凸多边形、曲面和拉伸特征的几何建模方法进行了研究。

In this article , studied geometric modeling method in OpenGL to render Non-convex polygon , surface and stretch feature .

凸多边形上的Bezier曲面片

The Bezier Patch on Convex Polygons

这种算法的计算复杂度优于标准的Delaunay算法，有效性也比许多凸多边形算法要突出，是一种行之有效的快速算法。

This method is better than Delaunay algorithm and is more efficient than other convex polygon algorithms .

本文提出求平面凸多边形直径的一种算法，该算法至多需要n&1次比较、n次求距离运算，其中n是凸多边形的顶点数。

An algorithm for determining the diameter of convex polygon is presented . It requires n-1 comparisons and n distance calculating operations , where n is the number or vertices of convex polygon .

对凸多边形上的椭圆边值问题，Rannacher，R.建立了一个有限元校正格式。

For elliptic boundary value problem on a convex polygonal domain , the correction method of finite element are posed in [ 1 ] .

研究了含执行器故障的线性时不变随机系统满足区域极点指标（一类凸多边形区域／扇形区域）、状态方差指标和H∞指标约束的满意容错控制；

Satisfactory Fault-Tolerant Control for a class of continuous linear systems with actuator failures under constraints of regional pole index ( convex polygon pole index , sector pole index ), steady covariance index and H_ ∞ - bound index .

LSIC凸多边形版图场分割数据处理的一种方法

Data processing of field division of convex polygon patterns in LSIC

根据质心和ZMP与支撑凸多边形的关系，提出了双足运动的动态程度分类。

The classification of biped locomotion , based on dynamic level , is proposed .

最后，采用Mori-Tanaka理论计算非完美界面条件下纤维增强复合材料的有效模量，其中纤维的横截面为凸多边形。

Finally , the Mori-Tanaka estimate is used to evaluate the effective moduli of polygon-shaped fibers composites having slightly weakened interface .

提出了一个新的问题，即在同一平面上，Alice有一个凸多边形，Bob有一条直线，直线与凸多边形相交，分凸多边形为两块。

A new problem is proposed , that is , in the same plane , Alice has a convex polygon and Bob has a straight line . The straight line intersect with the convex polygon so convex polygon is divided into two parts .

本文提出了一种非常有效的基于直线斜率的凸多边形线裁剪算法，并与Cyrus-Berk算法进行了比较。

This text puts forward a very effective clipping algorithm based on line 's slope , and compares it with Cyrus-Berk Algorithm .

求两凸多边形间的距离的快速算法

A fast algorithm for evaluating the distance between two convex polygons

基于直线斜率的凸多边形线裁剪算法凹多边形裁剪

Line clipping algorithm on convex polygon based on line 's slope

固定周长凸多边形的逐边构造

The Construction Edge by Edge a Convex Polygon with Fixed Perimeter

基于夹角符号序列的凸多边形直径算法

A Angle Sign Sequence Algorithm for Calculating Diameters of Convex Polygons

每条等值线线段把三角形单元分成若干个凸多边形，根据这些小多边形单元的平均应力或位移值并对照颜色表，把小多边形填充以不同的颜色就形成了云图。

This isoline divided the cell triangle into some protruding polygon .

统一确定两凸多边形支撑线的快速算法

A unified algorithm for determining the supporting lines between two convex polygons

判定凸多边形可碰撞性的并行算法

A Parallel Algorithm for Determining Possible Collision between Convex Polygons

凸多边形星图识别算法

A convex polygon star pattern identification algorithm for star sensor

曲凸多边形裁剪的串模式识别

A string pattern recognition approach to curved convex polygon clipping

在两种类型下并给出了凸多边形的简单切割方法。

Under the both conditions , the simple cutting methods are given .

本文说明一种把简单多边形分斛成凸多边形的差形式的组合的算法。

An Algorithm for finding convex decomposition of simple polygons is described .

改进的加权剖分简单多边形为凸多边形的算法

A Improved Weighting Algorithm for Decomposing a Simple Polygon into Convex Polygons

基于叉积法的凸多边形窗口裁剪算法

A Clipping Algorithm Based on Cross Product Method for Convex Polygon Window