Bibliographic Details
| Title: |
A Displacement Algorithm Considering Geometry Constraints to Resolve Spatial Conflicts between Roads and Buildings. |
| Authors: |
Ma, Jingzhen1,2,3 (AUTHOR) zb50mjz@163.com, Sun, Qun1 (AUTHOR), Xu, Li1 (AUTHOR), Sun, Shijie1 (AUTHOR), Wen, Bowei1 (AUTHOR) |
| Superior Title: |
Cartographic Journal. Feb2023, Vol. 60 Issue 1, p43-55. 13p. |
| Subject Terms: |
*SPANNING trees, *GEOMETRY, *ALGORITHMS, *PROBLEM solving |
| Abstract: |
Displacement is the most commonly used method to resolve spatial conflicts, but it creates difficulties in maintaining consistency in the spatial distribution pattern of building groups. In this study, a geometry constraints-oriented approach is proposed. First, buildings were classified according to the degree of encirclement by roads. On this basis, considering the road mesh as a unit, the minimum spanning tree was used to establish relationships between buildings and identify the structure of building clusters. In addition, the force received by the building was analyzed to determine the distance and direction of displacement. Owing to area constraints, buildings were scaled down to solve the problem of insufficient displacement space. Distance, direction, and area indicators were chosen as geometry constraints to conduct the displacement. Our results showed that the developed approach can effectively resolve spatial conflicts between roads and buildings, while maintaining the distribution pattern, and it is therefore a promising solution. [ABSTRACT FROM AUTHOR] |
|
Copyright of Cartographic Journal is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
|
Full text is not displayed to guests. |
Login for full access.
|