这是一个用VC语言实现任意多边形的Delaunay完全三角剖分算法的论文，可以参考。-This is an implementation using VC language completely arbitrary Delaunay polygon triangulation algorithm thesis, can refer to.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001295s ]
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.089289s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001196s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001938s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001205s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003590s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001048s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003184s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014326s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001305s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 151998 [ RunTime:0.001268s ]
