探求二维凸包及其应用
首发时间:2006-06-19
摘要:凸包是计算几何中最普遍、最基本的一种结构,本文介绍了二维凸包的概念和性质,并介绍几种求二维凸包的方法:Gift-Wrapping、Graham-Scan算法,以及这几种算法的正确性和时间复杂度的分析,最后通过两个实例来简要介绍二维凸包的应用。
关键词: 凸包、Gift-Wrapping、Graham-Scan
For information in English, please click here
Exploring two-dimensional Convex hull and its applications
Abstract: Convex hull is the most universal, a basic structure in geometric terms. This article introduced the concept and nature of two-dimensional convex hull, and introduced several approach to protrude two-dimensional convex hull: Gift-Wrapping, Graham-Scan algorithms, and analyze these types of algorithms correctness and time complexity, finally brief introduce the applications of the two-dimensional convex hull through the adoption of two examples.
Keywords: Convex Hull Gift-Wrapping Graham-Scan
基金:
论文图表:
引用
No.7211551441150707****
同行评议
共计0人参与
勘误表
探求二维凸包及其应用
评论
全部评论0/1000