摘要
多边形剖分在计算几何、计算机图象、图形处理中的是一个经典问题。本文提出一种新的算法 ,它把简单多边形剖分为凸多边形且使产生的凸多边形数目最少。
The special characters of convex hull decide its special status in computational theory and computer graphics,whereas what we touch upon in reality is far more often polygon than convex hull.This paper presents an algorithm with which we can find minimum set of convex hull,in other word,using minimum of line to cut the polygon into several convex hull.Meanwhile,we can give out the data structure and the procedure.
出处
《承德石油高等专科学校学报》
CAS
2003年第3期30-34,共5页
Journal of Chengde Petroleum College
基金
河北省自然科学基金资助项目 (60 2 40 5 )
关键词
多边形
剖分
算法
凸包
相交
凹点
polygon convex hull
intersect
concave dot
cut apart