An algorithm is presented for computing a convex hull of the vertices of a simple polygonal line. The basic idea is to compute in some phases. In each phase, the first line L 1 is computed under four different cases. Then some vertices on L 1 are arranged into an incremental sequence of the angles of the vertices in a specific way where line L 2 is constructed. Finally, L 2 is checked retrogressively and the vertices of non-convex hulls removed. The remaining points are the vertices of a convex hull. Th...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
