An algorithm for computing the minimum distance between two convex polyhedra is presented.
提出的算法,用于计算两个凸多面体之间的最小距离。
The result indicated that a great lot of virus polyhedra could be prepared by this method.
结果表明,可以用此方法大量制备病毒多角体。
The mechanism of KABO crystal morphology evolution was analyzed through the growth_units model of anionic coordination-polyhedra.
运用负离子配位多面体生长基元理论模型,分析了KABO晶体上述生长形态演化的机理。
Tested examples show that the set operations can work well under any situation provided the polyhedra to be operated are not morbid.
测试实例表明,只要参加集合运算的多面体不是病态的,该方案均能得出合理的运算结果。
A classification of the Medial Axis points in polyhedra is introduced, and the correlative relation of these Medial Axis points is discussed.
对多面体中轴点进行了分类,并揭示了不同类中轴点之间的几何关系。
The relationship between the crystallographic orientation of anionic coordination polyhedra and the surface structures was discussed in this paper.
本文讨论了晶体表面结构和负离子配位多面体结晶方位的关系。
A solid tessellation; a filling of three-dimensional space with polyhedra such that a face of one polyhedron is the face of exactly one other polyhedron.
一种立体嵌图;用多面体对三维空间的装填,使得一个多面体的面恰是另一个多面体的面。
The rare earth ions lie between the disilicate groups and the sheets of octahedra to form (8+3)-coordinated A(1)-polyhedra and 10-coordinated A(2)-polyhedra.
稀土离子位于双硅酸根和八面体层之间,形成(8+3 )配位的A(1)多面体和10配位的A(2 )多面体。
The formulation of group overlap integrals in coordination polyhedra is discussed. The basic expressions and some sum relations of group overlap integrals are given.
本文讨论了配位多面体的群重叠积分计算问题,给出了这种群重叠积分的一般形式以及它们满足的一些关系。
When external magnetic fields are absent, there may be a competitive growth between (100) and (111) surfaces; and the final morphology of particles are irregular polyhedra.
而当外磁场不存在的时候,(111)面和(100)面可能存在竞争生长的关系,从而纳米粒子呈现不规则的多面体形。
The algorithm builds BoxTreees of arbitrary non convex polyhedra using a hierarchical adaptive space subdivision scheme, and speeds up collision detection by traversing the BoxTrees in parallel.
该算法面向动态复杂场景采用层次的自适应空间剖分方法建构物体的平衡包围盒树,然后通过并行遍历包围盒树来加速碰撞检测。
The algorithm builds BoxTreees of arbitrary non convex polyhedra using a hierarchical adaptive space subdivision scheme, and speeds up collision detection by traversing the BoxTrees in parallel.
该算法面向动态复杂场景采用层次的自适应空间剖分方法建构物体的平衡包围盒树,然后通过并行遍历包围盒树来加速碰撞检测。
应用推荐