文件名称: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
相关搜索： gram convex
凸包
(系统自动生成,下载前可以参看下载内容)
下载文件列表
convex.cpp
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。