It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Level-set approaches are efficient and versatile methods for solving interface tracking problems and have been used in recent years to describe wildland fire propagation. Being based on an Eulerian description of the spread problem, their numerical implementation offers improved computational agility and better portability to parallel computing environments with respect to vector-based simulators. The use of a continuous representation of the fire perimeter in place of the binary formulation used in Cellular Automata avoids the commonly observed distortion of the fire shape. This work presents an algorithm for fire-spread simulation based on a level-set formulation. The results are compared to the ones obtained by two well-known Cellular Automata simulators under homogeneous conditions, and to the ones given by a well-know vector-based fire-spread simulator under realistic slope and wind conditions. According to this work, the level-set approach provides better results, in terms of accuracy, at a much reduced computational cost.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer