Graph theory and its applications
Graph theory and its applications
Automatic generation of tourist maps
ACM SIGGRAPH 2008 papers
A history of graph entropy measures
Information Sciences: an International Journal
Multi-granular spatio-temporal object models: concepts and research directions
ICOODB'09 Proceedings of the Second international conference on Object databases
Pattern recognition in road networks on the example of circular road detection
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Computer-Based methods for a socially sustainable urban and regional planning - CoMStaR
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
A probabilistic model for road selection in mobile maps
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Towards Platial Joins and Buffers in Place-Based GIS
Proceedings of The First ACM SIGSPATIAL International Workshop on Computational Models of Place
Road segment selection with strokes and stability
Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction
Hi-index | 0.00 |
This paper proposes a novel generalization model for selecting characteristic streets in an urban street network. This model retains the central structure of a street network. It relies on a structural representation of a street network using graph principles where vertices represent named streets and links represent street intersections. Based on this representation, so-called connectivity graph, centrality measures are introduced to qualify the status of each individual vertex within the graph. We show that these measures can be used for characterizing the structural properties of an urban street network, and for the selection of important streets. The proposed approach is validated by a case study applied to a middle-sized Swedish city.