摘要
平面上有限点集的凸壳在土木工程及其它许多领域均有很多重要应用,计算几何中的很多应用问题都与凸壳有关。现有多种求平面上点集凸壳的方法,但这些方法要么算法非常复杂,要么编码及实现非常困难。介绍了两种求平面点集凸壳的新方法,它们具有算法思想简单且易于编码实现的优点。
The convex hull of a finite planar set S has many important applications in civil and architectural projects and in many other fields. Many application problems in computational geometry relate to convex hull. There are many existing algorithms to determine the convex hull of a finite planar set, but some of them are very complicated and some are very difficult to be implemented and coded. Two more efficient algorithms that possess the advantages of simplicity in methodology and easiness in implementation are introduced.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第4期749-750,754,共3页
Computer Engineering and Design
关键词
平面点集
凸壳
算法
简单性
有效性
set of planar points
convex hull
algorithm
simplicity
efficiency.
