Conception d’un automate cellulaire non stationnaire à base de graphe pour modéliser la structure spatiale urbaine: le modèle Remus

Abstract

We propose a new approach of cellular automata, based on a graph frame, which allows the modelling of irregular and dynamic neighbourhood of spatial entities. The Remus model permits the computation of a graph representing the buildings and the transportation network (the urban graph), and thus the calculation of the network in time-distance between buildings. This model allows the extraction of various graphs, including the functional graph of the network-time-distances between buildings, and the neighbourhood- relationships graph which represents the network-neighbourhoods according to a certain time-distance-threshold and a given transportation mode.

Keywords

• cellular automata
• graph
• urban
• modeling/modelling
• neighborhood/neighbourhood