CAJ | 학술논문

采用了双向链表这种数据结构,对两简单多边形的顶点及交点进行存储,在对交点进行插入时,可直接插入链表中,避免了利用单向链表或数组进行存储时对点的重复查找。通过遍历两个顶点、交点混合表,可得到两多边形的交及多边形的顶点,从而得到两多边形的交集。相对其他类似的算法,该算法具有较快的计算速度和较高的效率。
채용료쌍향련표저충수거결구,대량간단다변형적정점급교점진행존저,재대교점진행삽입시,가직접삽입련표중,피면료이용단향련표혹수조진행존저시대점적중복사조。통과편력량개정점、교점혼합표,가득도량다변형적교급다변형적정점,종이득도량다변형적교집。상대기타유사적산법,해산법구유교쾌적계산속도화교고적효솔。
This algorithm utilizes the two-way list data structure to store the vertices and nodes of two simple polygons.When being inserted,the node can be directly inserted into the list,which can avoid a repeat search comparing with the one-way list and the array structures.The vertex of the intersection polygons can be acquired after the two mixed-point lists are searched,so that the intersection polygons can be obtained.The algorithm owns the rapid calculation speed and high efficiency comparing with the similar ones.