Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms

DOI10.1016/J.EJOR.2011.11.031zbMATH Open1244.90150OpenAlexW1973556215WikidataQ117808133 ScholiaQ117808133MaRDI QIDQ439586FDOQ439586

Authors: James MacGregor Smith, Alexander Stepanov 

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.031

Recommendations

• Modelling Wildfire Dynamics via Interacting Automata
• Numerical modeling of wildland surface fire propagation by evolving surface curves
• Parameter estimation of fire propagation models using level set methods
• Wildland fire propagation modelling: A novel approach reconciling models based on moving interface methods and on reaction-diffusion equations.
• Modelling and simulation of wildland fire in the framework of the level set method

zbMATH Keywords

Delaunay triangulationnatural resourcesminimum travel timeshortest path algorithmswildfire modeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Case-oriented studies in operations research (90B90) Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Prometheus
• Title not available (Why is that?)
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Delaunay refinement algorithms for triangular mesh generation
• Solving path problems on the GPU

Cited In (3)

• Pasting gauges. I: Shortest paths across a hyperplane
• Pasting gauges. II: Balls in pasted halfplanes
• Title not available (Why is that?)

Uses Software

• CGAL
• CUDA
• Triangle
• Prometheus
• Boost
• fireLib
• BEHAVE
• BGL
• FlamMap

This page was built for publication: Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439586)