查询词典 polyhedron

A projective silhouette based method was proposed to reconstruct the shape of little convex polyhedron.

为实现小凸多面物体面形快速重建，提出了基于投影轮廓的新方法。

The problem of robust stabilization for a class of linear systems with state and control delay, norm-bounded uncertainties or convex polyhedron uncertainties is discussed using delay dependent method.

构造了闭环系统二次型性能指标的一个鲁棒界，并给出了一个搜索最优控制器使得闭环系统鲁棒成本上界最小的凸规划方法。

Based on this model, a3- D random convex polyhedron aggregate model considering the actual aggregate content, gradation and shape of aggregate is established.

并在随机球骨料模型的基础上，形成随机凸多面体骨料模型。

The FORTRAN program to generate random convex polyhedron aggregate based on the topology of spherical aggregates and the codes of the meso-scale structured finite element grids of concrete are developed.

2为了实现骨料模型和其细观有限元网格的可视化，本文还研究了利用现有商业软件生成多面体随机骨料的可视化混合编程的方法。

The discriminance methods and expression of generalized alternative optimum solutions of linear programming is given by proving that the equivalent of optimum extreme point and extreme point of optimum solution sets of linear programming and applying the theorem of convex polyhedron.

通过证明线性规划最优解集的极点与线性规划最优极点的等价性，利用凸多面体的表达定理，给出了广泛意义下线性规划无穷多最优解的判别方法及表达式。

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.

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

Then, through quadratic separators, the sufficient condition of the fault tolerant controller existence can be transformed into the problem of solving some limited number of linear matrix inequalities, including each vertex of the convex polyhedron.

然后，通过二次可分原理，求解只包含关于凸多面体各顶点的有限个线性矩阵不等式，给出了容错控制器存在的充分条件。

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凸多面体体积公式的三维自然邻结点坐标及其导数的算法，给出了三维自然单元法算法的流程图。

Constrained surface and constrained maximum empty-sphere convex polyhedron are introduced to compute triangulation in spatial regions.

1引言空间或平面区域的Delaunay三角化（DelaunayTriangula－tion）广泛应用于数据插值、有限元分析、计算机图形学以及地理信息系统等领域。

This algorithm is proposed on the basis of the thought as follovvs: as for three dimensional Euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter.

如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱——它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。