convex polyhedron

Research on collision detection algorithm between convex polyhedron based on genetic algorithm

基于遗传算法的凸多面体间碰撞检测算法研究

Performance Analysis of Polynomial LPV System Based on Convex Polyhedron Construction

基于凸多面体构造的多项式LPV系统性能分析

Judging assembly contact states based on boundary components of convex polyhedron

基于凸多面体边界元的接触状态判断

The Application of Lattice Points Method on Uniform Designs in an Arbitrary Convex Polyhedron

任意凸多面体上均匀设计的格子点构作

Growth pattern and convexity conditions were analyzed for a convex polyhedron aggregate .

并以凸多面体为研究对象建立了凸型骨料的生长模式和骨料“凸性”条件，给出相应的随机投放算法。

Minimum zone method for evaluating flatness error based on the characteristic vertexes of convex polyhedron

基于凸多边体特征顶点的最小区域法求解平面度误差

A Fast Morphologic Addition Algorithm for Convex Polyhedron

凸多面体的快速形态和算法

Developing Convex Polyhedron Surface with Binary Tree Traversing

用二叉树遍历展开凸多面体外表面

The convex polyhedron aggregate model more accurately simulates the concrete material structure than the spherical aggregate model .

投放实例表明，与球形骨料假定建立的数值混凝土模型相比，凸多面体随机骨料模型能够更广泛地模拟混凝土材料结构。

Hidden Line Removal in a Convex Polyhedron

凸多面体的消隐线处理

On the generalization of Euler 's formula of convex polyhedron

凸多面体欧拉公式的推广

Based on it , a prediction algorithm of contact states with errors of the convex polyhedron 's boundary components was proposed .

以凸多面体为装配对象，给出了在误差的情况下基于凸多面体边界元的接触状态预测算法，并以单轴孔装配为例，说明了该算法的有效性。

Interference Algorithm of Convex Polyhedron

凸多面体的干扰算法

The processes of 3D buffer creation for point , line , face and convex polyhedron are introduced in detail in the paper .

详细论述了点，线，面和凸体的三维缓冲区生成过程。

It also proposes a method to construct the convex polyhedron and compute its volume , and presents the mathematical basis of the method .

本文也给出了构造该凸多面体、计算其体积的方法，并阐述了此方法的数学依据。

The Proofs on the Euler Theorem of Convex Polyhedron

凸多面体欧拉定理的证明

A Finite Algorithm for Finding the Shortest Distance between a Polyhedral Cond and a Convex Polyhedron

求多面体锥与凸多面体间的最短距离的一个有限算法

Moreover , the boundary initialization of population is obtained by getting all the extreme points of the bounded convex polyhedron .

边界上初始种群的获得比较复杂，它们是通过求得凸多面体所有极点来进行的。

The Cosine Theorem of the Convex Polyhedron

凸多面体的余弦定理

A branch-constructing algorithm for extreme vertices of the mixture convex polyhedron and a modified consim algorithm

混料凸多面体顶点的分枝构造法及修正的CONSIM算法

The three dimension parallel numerical computation of the wet-sieved concrete specimen was executed successfully to verify the program of random convex polyhedron aggregate .

为了验证本文提出的多面体骨料生成方法，利用现有细观力学分析并行程序成功地实现了对湿筛混凝土试件三维细观并行数值计算。

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

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

It is primarily based on the computation of algebraic variety on a given convex polyhedron and the real roots of the univariate interval polynomial .

该算法主要基于凸多面体内代数簇的计算和一元区间多项式实根的计算来实现。

In virtue of the improved algorithm of binary tree traversing , we can create all the layouts of developed patterns of a convex polyhedron .

借助改进的二叉树遍历算法并引入随机数，可以生成凸多面体外表面的各种不同的展开方式，为从中筛选最优方案，指导生产施工提供了帮助。

The paper first transforms the variational inequality problem in convex polyhedron to a complementary problem . On this basis , we proposed two kinds of prediction-correction methods .

首先将凸多面体上的变分不等式问题转换为互补问题，在此基础之上提出了两种预测校正算法。

On the base of analysis classic methods , the morphologic addition algorithm for convex polyhedron is predigested to the morphologic addition of faces in polyhedron .

在研究传统形态算法的基础上，将凸多面体的形态和算法简化为面与面的形态和，结合三维物体的法矢球模型，引入参考平面的概念。

Necessary and sufficient conditions of the robust positively invariant sets are established for the linear discrete-time delay system family specified by matrix convex polyhedron and additive interval disturbances .

对由矩阵凸多面体和区间扰动所描述的离散时滞线性时变系统族，得到了鲁棒正不变集的充分必要条件，并给出了证明以及两个推论。

A new decomposition algorithm in mathematic programming is discussed in this paper . Moreover , based on the basis of convex polyhedron , the Dantzig wolf algorithm and its improvement are presented .

分析讨论了一种数学规划的分解算法，并在凸多面体分析的基础上，讨论了Dantzig－Wolf算法及其改进。

A 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 is developed .

在生成三维随机球形骨料模型的基础上，研究了形成随机凸多面体骨料模型的方法，并利用FORTRAN语言编制凸多面体骨料生成程序和细观有限元网格剖分程序。

In this paper , we show that the Euler 's formula of convex polyhedron also holds in the following two cases : Case 1.Trees generating from some vertices of the polyhedron ;

将欧拉的凸多面体公式，推广至由多面体的顶点生长出树的情形，证明了在此情形下，欧拉公式仍成立。