WM: grouping applications (TAI)

[Maciej Pilichowski]

On Monday 04 May 2009 19:16:31 Matthew Woehlke wrote:

> > This is
> > interesting mathematical challenge, but even without much thought
> > I think it is not doable because there are cases when you get
> > clash. I.e. you end up with mutually depend exclusions.
> >
> > Unless you say, that we try first exclusions, and for all clashes
> > we compute sequence from geometry + take-first decision.
>
> I don't think the problem is unsolvable, just that the solution
> might not be optimal.

Terminology :-)), for me if you cannot have get guarantee on optimal 
solution this is not algorithmically solvable. And I believe this is 
ok with general definition :-) But I digress :-)

Algorithmic implementation -- Matthew, I won't comment it now, not 
that I ignore you, but the NWI as concept is not finished, and I 
cannot go into details at that stage (time). But when I could relax 
as we close the general level, I will be happy to discuss it, ok? But 
first things first.

> >> (I'm assuming that previous/next are bias-horizontal... which
> >> maybe should be an option :-).
> >
> > Nah, this one can be fixed :-) Btw. spatial alg. must also have
> > bias.
>
> Well it at least needs to cope with RTL :-).

Sure.

> How does u/d/l/r need a bias? (Or do you mean bias as in how I am
> assuming that, when "left" has two choices of window, always take
> the one with the longer shared border?)

Yes. Plus:

 B
A
 C

ABC, are squares. A -> ? no matter the choice it means, it has to be 
biased (either B will have priority over C, or C over B).

I think we think more or less about the same thing :-)

Cheers,