Abstract
Existing algorithms for geometry matching of multiple entities are short of meeting the requirements of multi-scale road network analysis due to algorithms' high complexity and long processing time. Based on the analysis of matching characteristics of poly-lines on road networks, this paper suggests the geometric similarities between poly-lines can be evaluated using the distances between poly-lines and nodes. As an alternative to a direct match of geometric similarities between poly-lines, this line-node distance-based algorithm has a much lower computational complexity and the potential for efficiency improvement with a grid-based spatial index. Through a case study, we compared the distance-based algorithm with the traditional matching algorithm in computational efficiency and matching quality. We found the proposed algorithm is superior in both domains and will be able to meet the requirements for multi-scale road network analysis. We also conducted an analysis on the relationships between matching tolerance and precision using the least square method.
| Original language | Chinese (Simplified) |
|---|---|
| Pages (from-to) | 84-90 |
| Number of pages | 7 |
| Journal | Acta Geodaetica et Cartographica Sinica |
| Volume | 36 |
| Issue number | 1 |
| Publication status | Published - 1 Feb 2007 |
Keywords
- Distance-based matching
- Geometry matching
- Multi-scale
- Road network
ASJC Scopus subject areas
- Computers in Earth Sciences
- Earth-Surface Processes