Convex hull problem is one of the fundamental problems incomputational geometry,and used in many fields. The traditional convex hull algorithms of point set and that of simple polygons have parallelly developed without any combination. In this paper, a new algorithm is proposed based on combining the convex hull algorithms of simple polygons into solving the problem of point set. The algorithms in this paper not only reaches the lower bound of O( n log n ),but also is very simple and easy to be realized...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
