Forest Fire Spread Modelling In Practice
Résumé
In this paper, we model forest fire spread on a grid of 2-D cells representing the landscape. The centers and the corners of the cells are connected to similar points by directed edges according to predefined neighbourhoods. This generates a graph over which fire can potentially spread. The fire rates of spread on the different edges are obtained by 3-D calculations under the assumption that local fires can be modelled by ellipses. Then, fire growth and eventually the final fire shape are elaborated using the Dijkstra's shortest path algorithm.