A simple least-squares fit in log-log space (not shown in the figure, but computed separately) reveals that the no-batch approach scales with an exponent closer to quadratic behavior O(N 1.7 ), whereas the dynamic batch approach tends toward more efficient, linear insertion times O(N 0.94 ). These exponents are indicative rather than absolute, since geometry, data distribution, and box packing strategies all influence the effective scaling.