查询词典 algorithm

In this paper, an arbitrary edge in the plane of the convex polygon generating algorithm, discussed the randomly generated convex polygon vertex algorithm idea.

本文研究在平面中生成任意边的凸多边形的算法，讨论了随机生成凸多边形顶点坐标的算法思想。

A dynamic real-time collision detection algorithm facing to the convex polyhedron in virtual environment is presented, which is based on the incremental algorithm.

在Lin-Canny算法的基础上，提出一种虚拟环境下面向凸体的动态、实时碰撞检测方法。

To increase the running speed of the collision detection algorithm, a new approach is proposed, which uses convex Bounding Volume Hierarchies to express convex polyhedron. Thus the distance problem of two convex polyhedrons is come down to a nonlinear programming problem with constraints. The nonlinear programming problem can be solved by simulated annealing genetic algorithm.

为了提高碰撞检测算法的速度，提出用顶点的凸包表示凸多面体，将两个凸多面体间距离的问题归结为一个带约束条件的非线性规划问题，利用模拟退火遗传算法对该问题进行求解。

The algorithm for calculating natural neighbour co-ordinates and their derivatives based on Lasserre's algorithm for the volume of a convex polyhedron was derived and the generalized flowchart for NEM in 3D case was presented.

文中推导了基于 Lasserre凸多面体体积公式的三维自然邻结点坐标及其导数的算法，给出了三维自然单元法算法的流程图。

Under some assumption conditions, we also developed trust region and affine scaling algorithm and potential reduction algorithm for convex programming problem with linear constraints.

然后在一定的假设条件下，对线性约束下的凸规划问题我们给出了相应的信赖域仿射尺度算法和势函数下降算法。

Based on quickqull algorithm,an improved algorithm to determine the convex hull of 2-D point set was proposed in this paper.

凸包问题是计算几何的基本问题，分为平面点集凸包和多边形凸包2类。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

Aiming at shadow influence problem in vision navigation process of agricultural robot, illumination invariant image based on shadow removal algorithm was introduced. An enhanced OSTU image segmentation method was used, and an optimized Hough transformation algorithm was used to extract crop line, and coordinate transform was applied to obtain navigation parameters.

该研究针对农业机器人视觉导航中存在的阴影干扰问题，采用基于光照无关图的方法去除导航图像中的阴影，然后采用增强的最大类间方差法进行图像分割和优化的Hough变换提取作物行中心线，最终通过坐标转换获得导航参数。

This algorithm lights five pixels in a loop between the coordinate information of line's start and end points. Therefore, the speedof generating of straight line can be accelerated. Compared with the four-step, it is the speed that increased by about 20% while the complexity is almost the same. Meanwhile the five-step still maintains the precise of the traditional line scan conversion algorithm.

该算法过给定的直线的始点和终点，可以一次计算得到并且点亮五个象素点，从而较传统的直线扫描转换算法成倍地提高了直线的生成速度，与著名的"四步法"相比，几乎没有增加复杂性，而速度则提高约20%，同时仍然保持传统直线扫描转换算法的精度。

To image plane coordinate An ipsilateral total tangent algorithm is proposed in the paper, and the algorithm is proved to be effective for solving the coordinate transformation matrix by an example.

为了解决数码相机定位问题，利用双目定位法，在确定物平面坐标系与像平面坐标系的坐标变换矩阵的基础上，提出了一种同侧共切线算法，结合算例证明了这种算法可以有效地求解此坐标变换矩阵。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。