摘要
针对Visual C++环境下多边形裁剪算法实际应用中出现的问题，分析了其产生的原因，给出了具体的解决方法。同时指出可以通过判断矢量多边形面积的正负值将多边形的顶点按照顺时针或逆时针方向排序。
The paper analyses the error which is made in realization of clipping polygon method based on visual C ++. Then specific processing method about how to deal with it is provided. At the same time the author points out that the polygon vertexes can be sorted clockwise or anticlockwise by judging the sign of the vector polygon area.
作者
杨哲海
钟海云
等
YANG Zhe hai 1, ZHONG Hai yun 2,WU Guan xiang 1(1.Institute of Surveying and Mapping,Information Engineering University,Zhengzhou 450052,China;2.65015 Troops, Dalian 116023, China)
出处
《测绘学院学报》
北大核心
2003年第1期43-46,共4页
Journal of Institute of Surveying and Mapping
