Abstract
In order to apply advanced high-level concepts for transportation networks, like hypergraphs, multi-level wayfinding and traffic forecasting, to commercially available street network datasets, it is often necessary to generalise from network primitives. However, the appropriate method of generalisation strongly depends on the complex street network feature they belong to. In this paper, we develop formal expressions for road segments and some essential types of roads, like roundabouts, dual carriageways and freeways. For this purpose, a formal network language is developed, which allows a clear distinction among the geometrical network, its embedding into the Euclidian plane, as well as navigational constraints for a traffic mode.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Egenhofer, M.J., Herring, J.R.: Categorizing binary topological relationships between regions, lines and points in geographic databases. In: Technical Report, Department of Surveying Engineering, University of Maine, Orono (1991)
Farmer, W.M.: A Basic Extended Simple Type Theory. SQRL Report 14 (2003)
Farmer, W.M., Mohrenschmidt, M.: Simple type theory: Simple steps towards a formal specification. In: 34th ASEE/IEEE Frontiers in Education Conference, Savannah, GA, F1C-6, IEEE, Los Alamitos (2004)
Goodchild, M.F.: Geographic Information Systems and Disaggregate Transportation Modelling. Geographical Systems 5(1–2), 19–44 (1998)
Mainguenaud, M.: Modelling the Network Component of Geographical Information Systems. Int. J. Geographical Information Systems 9(6), 575–593 (1995)
Stell, J.G.: Granulation for Graphs. In: Freksa, C., Mark, D.M. (eds.) COSIT 1999. LNCS, vol. 1661, pp. 417–432. Springer, Heidelberg (1999)
Stell, J.G., Worboys, M.: Generalizing Graphs using Amalgamation and Selection. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, pp. 19–32. Springer, Heidelberg (1999)
Timpf, S., Volta, G.S., Pollock, D.W., Egenhofer, M.J.: A Conceptual Model of Wayfinding Using Multiple Levels of Abstractions. In: Frank, A.U., Formentini, U., Campari, I. (eds.) Theories and Methods of Spatio-Temporal Reasoning in Geographic Space. LNCS, vol. 639, pp. 348–367. Springer, Heidelberg (1992)
Timpf, S., Kuhn, W.: Granularity Transformations in Wayfinding. In: Freksa, C., Brauer, W., Habel, C., Wender, K.F. (eds.) Spatial Cognition III. LNCS (LNAI), vol. 2685, pp. 77–88. Springer, Heidelberg (2003)
Zhou, C., Lu, F., Wan, Q.: A Conceptual Model for a Feature-Based Virtual Network. GeoInformatica 4(3), 271–286 (2000)
Tang, A.Y, Adams, T.M., Usery, E.L.: A Spatial Data Model Design for Feature-Based Geographical Information Systems. International Journal of Geographical Information Systems 10(5), 643–659 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheider, S., Schulz, D. (2007). Specifying Essential Features of Street Networks. In: Winter, S., Duckham, M., Kulik, L., Kuipers, B. (eds) Spatial Information Theory. COSIT 2007. Lecture Notes in Computer Science, vol 4736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74788-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74788-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74786-4
Online ISBN: 978-3-540-74788-8
eBook Packages: Computer ScienceComputer Science (R0)