The rate-limiting step in performing topological analysis via a graph over grid points is the construction of the Delaunay triangulation which scales as O(N log(N )) in the number of grid points N . This scaling is reflected in our calculation times (see Fig. ). Note that we use a largely unoptimized python code, so the absolute time shown on the y axis of Fig. could be improved relatively easily if desired, but the scaling will remain O(N log(N )).