Utilizing the property that the distances from all points located on the borderline of buffer zone to corresponding buffer target are the same, this paper presents a novel method of buffer generation based on vector boundary tracing. The new method can avoid complex vector calculations, such as line and curve segment intersection, clipping and recombination, the closure of borderline and so on, and also has an advantage of high precision the same as all existing vector-based algorithms. The main steps of this algorithm include: (1) Generate the initial tracing point set located on the borderline of buffer zone; (2) Obtain an integrated and closed borderline by tracing these points; (3) Construct the area targets on the basis of these losed borderlines. The test results and analysis indicate that this algorithm has a great advantage in the aspects of decreasing EMS memory consumption and improving calculation accuracy, and its computational efficiency can fully meet the demand of usual application in GIS. Furthermore, the principle of boundary tracing in the algorithm has a potential for further being promoted and used to design related spatial analysis algorithms.
- 粉丝: 0
- 资源: 18
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- Screenshot_20240427_031602.jpg
- 网页PDF_2024年04月26日 23-46-14_QQ浏览器网页保存_QQ浏览器转格式(6).docx
- 直接插入排序,冒泡排序,直接选择排序.zip
- 在排序2的基础上,再次对快排进行优化,其次增加快排非递归,归并排序,归并排序非递归版.zip
- 实现了7种排序算法.三种复杂度排序.三种nlogn复杂度排序(堆排序,归并排序,快速排序)一种线性复杂度的排序.zip
- 冒泡排序 直接选择排序 直接插入排序 随机快速排序 归并排序 堆排序.zip
- 课设-内部排序算法比较 包括冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、归并排序和堆排序.zip
- Python排序算法.zip
- C语言实现直接插入排序、希尔排序、选择排序、冒泡排序、堆排序、快速排序、归并排序、计数排序,并带图详解.zip
- 常用工具集参考用于图像等数据处理