| 两个三角形不相交的充要条件 |
| |
| 引用本文： | 何大华,陈传波.两个三角形不相交的充要条件[J].应用数学,2002(Z1). |
| |
| 作者姓名： | 何大华 陈传波 |
| |
| 作者单位： | [1]华中科技大学计算机学院 [2]华中科技大学计算机学院 武汉 |
| |
| 摘 要： | 判断平面上两个三角形是否相交是求解三角形Packing问题的一种基本操作 .本文提出了两个三角形不相交的一个充要条件 ,并将不相交判别法与相交判别法作了比较 ,比较结果表明不相交判别法比相交判别法在计算速度上有根本的改善 .
|
| 关 键 词： | 三角形Packing问题 两步策略 相交 外半平面 内半平面 |
A Sufficient and Necessary Condition of Two Triangles' Non-Overlapping |
| |
| HE Da-hua,CHEN Chuan-bo.A Sufficient and Necessary Condition of Two Triangles'''' Non-Overlapping[J].Mathematica Applicata,2002(Z1). |
| |
| Authors: | HE Da-hua CHEN Chuan-bo |
| |
| Abstract: | Determing if two triangles on the plane come across each other is a very common operation in tackling with triangle packing problem.In this paper,a sufficient and necessary condition of two triangles' non-overlapping;is provided and the method that uses non-overlapping conditions with that of using overlapping conditions are compared with each other,the comparing results show that the former has much better performance than the later. |
| |
| Keywords: | Triangle Packing Problem Two-Stage-Strategy Overlapping Inner semi-Plane External Semi-Plane |
| 本文献已被 CNKI 维普 等数据库收录！ |
