Coding Challenge: Wildfire Perimeter Growth Algorithm

Hi Dan,

I’d love to see how you’d go about implementing a fire perimeter growth algorithm in either processing or p5. There are two algorithms that are similar but not identical.

The first is a minimum travel time algorithm (ref: https://www.snap.uaf.edu/webshared/JenNorthway/AKFireModelingWorkshop/AKFireModelingWkshp/FSPro%20Analysis%20Guide%20References/Finney%202002%20Fire%20Growth.pdf)

The second is the US FARSITE model (ref: https://www.fs.fed.us/rm/pubs/rmrs_rp004.pdf).

The first is simpler, but the second is more complete. I’d love to see how you tackle either.

Thanks Dan, I hope you give this one some consideration but either way, keep up the great content!

Non viene indicato alcun file del repository, test o punto di ingresso. Prima confronta i riferimenti a minimum-travel-time e FARSITE e scegli quale ambito perseguire; il lavoro sarà completato quando sarà disponibile un’implementazione funzionante in Processing o p5 dell’algoritmo selezionato di crescita del perimetro dell’incendio boschivo.

Scritto dal modello di indicizzazione a partire dal testo della issue.