Describe the feature

By default, we have a simple offset integer, resulting in searching in a cube x meters away in any axis. This results in an unnecessarily large or inconveniently small scanning distance.

I suggest more modes, possibly with more intelligent backtracing.
We keep the current one as the first.
The second is obvious. A euclidean distance, we can make it faster like minecraft does and ignore the square roots.
The third could be a manhattan distance, where 2 meters away is 2 meters straight and 1 diagonally.

We can also introduce weighting, so moving from one log direction to another incurs a greater cost. This will prevent trying to cut down neighboring trees quite as much. A legitimate tree is unlikely to have a shape where it branches out horizontally and then goes vertically again for more than a block or two.