Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms |
| |
Authors: | Alexander Stepanov James MacGregor Smith |
| |
Institution: | a Campus Planning, University of Massachusetts, Amherst, MA 01003-5220, United States b Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MA 01003-5220, United States |
| |
Abstract: | In this paper, a methodology for modeling surface wildfire propagation through a complex landscape is presented. The methodology utilizes a Delaunay triangulation to represent surface fire spread within the landscape. A procedure to construct the graph and estimate the rate of spread along the edges of a network is discussed. After the Delaunay data structure is constructed, a two pass shortest path algorithm is incorporated to estimate the minimum travel time paths and fire arrival times. Experimental results are also included. |
| |
Keywords: | Natural resources Delaunay triangulation Shortest path algorithms Minimum travel time Wildfire modeling |
本文献已被 ScienceDirect 等数据库收录! |
|