您要查找的是不是：
- normal convex polyhedron 正常凸多面体
- A projective silhouette based method was proposed to reconstruct the shape of little convex polyhedron. 为实现小凸多面物体面形快速重建,提出了基于投影轮廓的新方法。
- Based on this model, a3- D random convex polyhedron aggregate model considering the actual aggregate content, gradation and shape of aggregate is established. 并在随机球骨料模型的基础上,形成随机凸多面体骨料模型。
- Based on this model, a 3-D random convex polyhedron aggregate model considering the actual aggregate content, gradation and shape of aggregate is established. 同时，研究了细观单元属性判别方法，编制了对含有凸多面体骨料的细观区域进行结构性有限元网格剖分程序。
- On the base of analysis classic methods, the morphologic addition algorithm for convex polyhedron is predigested to the morphologic addition of faces in polyhedron. 在研究传统形态算法的基础上;将凸多面体的形态和算法简化为面与面的形态和;结合三维物体的法矢球模型;引入参考平面的概念.
- Conclusion A weakly logarithmically convex (concave) function has some good properties, and is closely related to a normal convex (concave) function. 结论弱对数凸（凹）函数有很好的性质，与凸（凹）函数存在着紧密的关系。
- According to the viewpoint of combination tope, any convex polyhedron can be composed of some simplexes, and both convex polyhedron and simplex are important concepts of programming theory, so it's necessary to find their volumes in some calculations. 由组合拓扑学可知,任意凸多面体均为若干个单纯形的某种组合,两者均为规划论中最重要的基本概念之一,因而在一些计算中对其求积是不可少的。
- dividing a convex polyhedron to tetrahedrons 凸多面体剖分
- An algorithm for computing the minimum distance between two convex polyhedra is presented. 摘要提出了一种计算两凸多面体间最短距离的算法。
- I_COLLIDE is an interactive and exact collision detection library for large environments composed of convex polyhedra . COLLIDE是一个交互式的和确切的冲突检验库，它用于由凸起的多面体组成的大的环境中。
- A discontinuous method is proposed for arbitrary convex polyhedral finite elements in the context of elasticity. 摘要对弹性力学问题，提出一种任意凸多面体间断有限单元法。
- Many non-convex polyhedra may be decomposed into a set of convex polyhedra, which may then be used with this library. 很多非凸起的多面体可能被分解成一系列的凸起的多面体，这样就能被用于库。
- A Fast Morphologic Addition Algorithm for Convex Polyhedron 凸多面体的快速形态和算法
- The problem of minimum translational distance(MTD for short) of convex polyhedra is always an active subfield of computer graphics. 凸多面体的最小平移距离问题一直以来都成为计算机图形学的一个研究热点。
- Collision detection can be modeled a mathematical problem to determine whether the intersection of two convex polyhedra is empty or not. 碰撞检测可以建模为判断2个三维凸多面体是否相交的问题。
- A New Generation Algorithm for Spatial Convex Polyhedron 一种新的空间凸多面体的生成算法
- The computer has a normal qwerty keyboard. 这台计算机有标准的英文键盘。
- A Study on A Fast Latent Algorithm of Convex Polyhedron 凸多面体的一种快速消隐算法的研究
- Developing Convex Polyhedron Surface with Binary Tree Traversing 用二叉树遍历展开凸多面体外表面
- The situation has returned to normal in the city. 这座城市的局势已恢复正常。
