Re: [PATCH 2/3] Implement TINN algorithm.

[Michael Stefaniuc]

Vitaly Budovski wrote:
> Implement the Triangle Inequality Nearest Neighbour algorithm as
> described in
> http://post.queensu.ca/~greensm/papers/tinn.pdf
> ---
>  include/wine/tinn.h |  154

Do you need that somewhere else then in the X driver? If not putting
that directly into dlls/winex11.drv/ makes more sense.
> +++++++++++++++++++++++++++++++++++++++++++++++++++
>  1 files changed, 154 insertions(+), 0 deletions(-)

bye
	michael
-- 
Michael Stefaniuc               Tel.: [phone]
Sr. Network Engineer            Fax.: [phone]
Red Hat GmbH                    Email: mstefani(a)redhat.com
Hauptstaetterstr. 58            http://www.redhat.de/
D-70178 Stuttgart

[PATCH 2/3] Implement TINN algorithm.

[Vitaly Budovski]

Michael Stefaniuc wrote:
> Vitaly Budovski wrote:
> > Implement the Triangle Inequality Nearest Neighbour algorithm as
> > described in
> > http://post.queensu.ca/~greensm/papers/tinn.pdf
> > ---
> >  include/wine/tinn.h |  154
>
> Do you need that somewhere else then in the X driver? If not putting
> that directly into dlls/winex11.drv/ makes more sense.
> > +++++++++++++++++++++++++++++++++++++++++++++++++++
> >  1 files changed, 154 insertions(+), 0 deletions(-)
>
> bye
>   michael

The algorithm is quite generic really. It basically exists to solve the 
nearest neighbour problem, so anywhere that such a solution is needed 
this algorithm could be used. I had a bit of a look and I think there 
are another few sections that this could be used.

[PATCH 2/3] Implement TINN algorithm.

[Stefan Dösinger]

> The algorithm is quite generic really. It basically exists to solve the
> nearest neighbour problem, so anywhere that such a solution is needed
> this algorithm could be used. I had a bit of a look and I think there
> are another few sections that this could be used.
> WineD3D may have use for it too, but I haven't checked yet. It does 256 bit 
> palette <-> A8R8G8B8 conversion