文件名称:convex
介绍说明－－下载内容均来自于网络，请自行研究使用
gram法求凸包，
凸包是区域内任意两点的直线不与边界相交的简单闭区域。
gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve a convex point set
凸包是区域内任意两点的直线不与边界相交的简单闭区域。
gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve a convex point set
(系统自动生成,下载前可以参看下载内容)
下载文件列表
convex.cpp