Performance Analysis of RouteSegmentation Algorithm in Identifying Perimeter Area Around Travel Route

Prior study has developed the RouteSegmentation algorithm to identify the perimeter area surrounding a route. In this study, a comparative experiment was carried out to investigate the performance of the RouteSegmentation algorithm implementation in contrast to the RouteBoxer algorithm. Both algorithms play a crucial role in geographical information systems (GIS), particularly in enhancing navigational tools by identifying points of interest along specified routes. Through systematic experimentation using various perimeter distance values and types of route, the trade-offs between processing efficiency and the granularity of the area identified by these algorithms were evaluated. The results demonstrate that RouteSegmentation maintained relatively consistent performance across different perimeter distance values and statistically significantly faster processing time than RouteBoxer. Furthermore, while the RouteBoxer algorithm benefits from larger perimeter distance values by reducing processing time, it compromises the coverage results of the algorithm and potentially undermines its usefulness in practical scenarios. This study not only provides insights into the optimal use of perimeter distance values for each algorithm but also guides users in selecting the appropriate algorithm based on their specific application needs, balancing detailed geographical analysis and runtime efficiency.