Axon 第九章凸包问题 (Two-Dimensional Convex Hull) 凸包问题基本定义与性质 基本概念: 凸集——如果平面上的一个点集中任意两点之间的连 线上的点都属于这个点集,则称这个点集...
基于30个网页-相关网页
凸包问题是计算几何的基本问题之一,在许多领域均有应用。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
最小凸包是计算几何中得到广泛研究的问题之一,在地理信息系统中也有着广泛应用。
The minimum convex closure is one of the widely studied problems in science of computing geometry, as well as extensively applied in many fields of GIS.
最后,介绍了目前流行的两种投票法,并针对现有投票法的问题和缺点,提出一种最小内凸包的算法。
To solve the problems, the minimum internal convex hull algorithm is proposed in this paper. The method holds both low-computational costs and faster calculation speed .
应用推荐