Before revision:  The complexity is adaptive and comparable to that of previous methods , namely linear in the number of sites, namely edges or facets resp  .
After revision:  The complexity is adaptive and comparable to that of previous methods . Under a mild assumption it is O(n / \Delta + 1 / \Delta^2) in 2D or O(n\alpha^2 / \Delta^2 +1 / \Delta^3) in 3D, where n is the number of sites, namely edges or facets resp .