资源描述该算法课通过解压运行QHULL-GO快捷方式，在命令行窗口输入相应的命令，即可计算convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram。并且代码还可以求解2维、3维甚至更高维的数据计算。是一个开放的源码算法，凝聚了很多大牛的心血，希望对大家有所帮助。
文 件 列 表
qhull-2012.1 Announce.txt bin build CMakeLists.txt config COPYING.txt eg File_id.diz html index.htm Makefile qhull-2012.1-zip.md5sum QHULL-GO.lnk README.txt REGISTER.txt src
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.018524s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.132816s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001501s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001982s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001628s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005625s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001352s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006930s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.025271s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001635s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 260317 [ RunTime:0.025117s ]
