Fig. shows the runtime of Algorithm 1 (the structured grid algorithm) vs. the number of grid points for an example with typical meteorological conditions from the ADED campaign described in Section 2.1. This is compared to a timing curve from the naive implementation where a coarse temporal threshold but no spatial threshold has been applied, so equation ( ) is evaluated at every grid point in the computational domain. While both methods clearly scale linearly in complexity with the number of evaluation points, Algorithm 1 is nearly two orders of magnitude faster than the naive approach. Notably, the naive algorithm would take 11.5 hours for a simulation with one million points while our algorithm finished in just over 3 minutes.