摘要
多边形分割是多边形剪切的特殊情况之一,目前多边形分割的算法较为复杂且适用范围有很大的局限性。本文根据多边形的图形定义给出两个约束条件,然后根据约束条件结合多边形点序特征,提出一种基于点序的多边形分割算法。此外本文还依据多边形剪切和多边形分割的关系,扩展基于点序的多边形分割算法在多边形剪切中的实现,经试验分析达到了理想效果。
Polygon splitting is a speciality of polygon cutting, nowadays the methods of polygon splitting is very complex and has a lot of limitation. The paper gives two limitations according to the definition of polygon and then together with these two limitations puts forwards to a new method to fulfill polygon splitting based on the index of nodes. Besides the paper expands the method to realize polygon cutting with respect to the polygon cutting, which is proved to be efficient by an experiment.
出处
《信息技术与信息化》
2012年第5期100-102,105,共4页
Information Technology and Informatization
关键词
多边形分割
多边形剪切
点序
折线分割
Polygon splitting Polygon cutting Index of nodes Polyline splitting
