| 空间点集卷包裹算法的优化实现 |
| |
| 引用本文： | 吴克勤,杨冠杰. 空间点集卷包裹算法的优化实现[J]. 中国海洋大学学报(自然科学版), 2003, 33(4): 627-633 |
| |
| 作者姓名： | 吴克勤 杨冠杰 |
| |
| 作者单位： | 中国海洋大学计算机科学系,青岛 266003 |
| |
| 基金项目： | 山东省自然科学基金项目 (Y2 0 0 2 G12 )资助 |
| |
| 摘 要： | 凸包计算是计算几何研究中的基本问题之一 ,在许多领域均有应用。本文对求解空间点集凸包的卷包裹算法的实现问题进行了讨论。提出了 2点优化措施 ,并解决了实现中可能出现的共面点及由此带来的退化问题。
|
| 关 键 词： | 凸包 卷包裹算法 空间点集 计算几何 |
| 文章编号： | 1001-1862(2003)04-627-07 |
| 修稿时间： | 2002-09-20 |
An Optimized Implementation of the Gift-Wrapping Algorithm for Three-Dimensional Convex Hull |
| |
| Wu Keqin Yang Guanjie. An Optimized Implementation of the Gift-Wrapping Algorithm for Three-Dimensional Convex Hull[J]. Periodical of Ocean University of China, 2003, 33(4): 627-633 |
| |
| Authors: | Wu Keqin Yang Guanjie |
| |
| Abstract: | Convex hull computation is one of the fundamental problems in computational geometry , and is of wide application in many fields. In this paper the efficient implementation of the gift-wrapping method for computing the convex hull of 3D point sets is discussed. Two optimization methods to improve the efficiency are presented, and also proposed is a solution to the coplanar points and derived degeneracy problems, which might occur during the algorithm running. |
| |
| Keywords: | convex hull gift-wrapping algorithm three-dimensional point sets computational geometry |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
