Name
Abstract | ||
|---|---|---|
Urban areas are often segmented into sub-regions for indepth analysis and complexity reduction. This paper tries to use vector based model to segment urban areas into regions by adopting a graph theory approach. Vector-based model uses geometric primitives such as points, lines and polygons to denote spatial objects on the Cartesian coordinate system. Generally, we mainly store and analyze the vector data with Post GIS, in which a myriad of powerful functions are available. Here, we first find all intersections of road segments and turn vector data into a graph. Secondly, we simplify the graph by merging the redundant lines and removing the needless points. Lastly, dijkstra algorithm is applied to partition the areas into regions. In addition, we will present a case study of the Open Street Map data of Beijing to demonstrate the usability of the segmentation method. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/UIC-ATC-ScalCom.2014.89 | UIC/ATC/ScalCom |
Keywords | Field | DocType |
urban areas segmentation,vector-based model,graph theory,geometric primitives,Cartesian coordinate system,Dijkstra algorithm,OpenStreetMap data,Beijing,geographical information system,GIS | Graph theory,Data mining,Polygon,Computer science,Segmentation,Geometric networks,Geometric primitive,Theoretical computer science,Reduction (complexity),Distributed computing,Dijkstra's algorithm,Cartesian coordinate system | Conference |
Citations | PageRank | References |
1 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Si Zhao | 1 | 1 | 0.34 |
| Hongwei Wu | 2 | 1 | 0.34 |
| Lai Tu | 3 | 3 | 4.08 |
| Benxiong Huang | 4 | 168 | 19.36 |