Whilst the graph algorithm exhibits rapid convergence with grid size, the convergence is quite noisy -as can be seen in detail in Fig. . However, this noise is on the order of (or smaller than, in the case of the kinetic energy) the difference between the lunatic and extra-lunatic Multiwfn grids, using 4 orders of magnitude fewer grid points than the latter. One potential method to reduce this convergence noise would be to assign fractional basin weights from each grid point to each basin, as illustrated in Fig. . Given that we already construct the Delaunay triangulation, which allows for rapid calculation of the Voronoi tiling, the weighting method proposed in Ref. would be particularly suitable.