Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms

DOI10.1016/j.ejor.2011.11.031zbMath1244.90150OpenAlexW1973556215WikidataQ117808133 ScholiaQ117808133MaRDI QIDQ439586

James MacGregor Smith, Alexander A. 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

zbMATH Keywords

natural resourcesDelaunay triangulationshortest path algorithmsminimum travel timewildfire 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)

Related Items (3)

Unnamed Item ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Pasting gauges. II: Balls in pasted halfplanes

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Prometheus
• Solving path problems on the GPU
• Delaunay refinement algorithms for triangular mesh generation
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

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