Re: [AD] new GUI focus selection algorithm

[Eric Botcazou <ebotcazou@xxxxxxxxxx>]

> Interesting, but there are still counterexamples: in the following
> example, A can't be reached:
>
>               B
>           I       C
>
>         H     A     D
>
>           G       E
>               F
>
> :-)

Note that I wrote "a" distance, so you are free (and even encouraged :-) to 
give more weight to whaever axis you want.

> I don't think there is an algorithm that works with all examples though.

I agree.

> Here is a suggestion of another way of computing distance: the distance
> between A and B is the minimum, taken over all points a inside A and all
> points b inside B, of the distance between a and b.

Probably better, indeed.

-- 
Eric Botcazou