| 1. | Algorithm on the convex hull of a simple polygon
简单多边形凸包的算法 |
| 2. | The algorithm for convex hull set of plane finite point set
平面有限点集最小凸包集的计算方法 |
| 3. | Research on fixed direction hull bounding volume in collision detection
碰撞检测中的固定方向凸包包围盒的研究 |
| 4. | Absolute convex hulls
绝对凸包 |
| 5. | And its convex hull
及其凸包 |
| 6. | This article researches mostly on how to improve the convex hull algorithm of planar point set
本文的主要内容是对凸包的算法进行改进。 |
| 7. | In this paper , application of convex hull is proposed to slove the problem of global tool interference avoidance in 5 - axis sculptured surface machining
本文提出了运用凸包法解决在五轴加工中刀具干涉的算法。 |
| 8. | With the background of surgery simulation , this paper proposes a collision detection method based on fixed direction hull bounding volume tree
本文以虚拟手术仿真为应用背景，着重论述了一种基于固定方向凸包包围盒层次的碰撞检测方法。 |
| 9. | The complexity of runtime is the least in the worst instance . other algorithm , for example jarvis method , get better result in some instance , but runtime complexity is o ( n2 ) in the worst instance
根据统计表明，在一般的情况下点集的点并不都是凸包的顶点，这时候，传统的经典算法的复杂度也是o ( nlogn ) 。 |
| 10. | The constrained conditions are unproved using the tighter convex hull property of the control points degree elevated or subdivided , so the results of this method are better than those of literature [ 33 ]
最后应用bezier方法的升阶和细分技术获得更紧的控制网格凸包，改进优化模型的约束条件，获得更好的降阶逼近。 |
