欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
凸多边形交、并求解的难点在于如何维护结果多边形的顶点序列.提出了以顶点与多边形的空间拓扑关系为基础,将不同拓扑关系的顶点进行重新组合的方法来解决任意2个凸多边形交、并的求解问题.算法易于编程实现,能够较好的求解二维凸多边形区域各种情况的交与并,可为G IS应用中矢量多边形之间的关系计算提供算法基础.
英文摘要：
The difficulty of the intersection and union of the convex polygons is maintaining the order of vertices. The algorithm is based on the spatial topological relationships between the vertex and the polygon, and resets different topological vertices in order to solve the problem of the intersection and union of the convex polygons. The algorithm is easy in practice and well solves the 2D＇s problems of the intersection and union of the convex polygons, while providing the basis of algorithm for calculating the relationship between vector polygons in the application of GIS.
同期刊论文项目
同项目期刊论文
位置：