[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-kimageshop
Subject:    Re: Scaling algorithms in Krita Bad (at least at downscaling)
From:       Sander Koning <sanderkoning () kde ! nl>
Date:       2006-11-12 23:25:36
Message-ID: 20061112232536.GS16010 () macedon ! demon ! nl
[Download RAW message or body]

[Attachment #2 (multipart/signed)]


Casper Boemann wrote on 2006-11-12 16:39 +0100 regarding Re: Scaling algorithms in \
Krita Bad (at least at downscaling):
> On Sunday 12 November 2006 11:10, Torsten Rahn wrote:
> > > Resampling by just taking the average of points 1 to N, then N+1 to 2N,
> > > etc., should already be a better solution.
> > 
> > That wouldn't be "Bilinear" but just "Linear".

Substitute "points 1 to N" by "the array of points (0,0) to (N,N)", or do
anything else to fit in your scaling algorithm of choice... 

> but is what we already do anyway

I don't really care about what method is used as long as it gives a reasonable
default output within a sane response time. If (bi)linear doesn't do the trick,
we'll have to use something else ;)

-- 
Sander Koning  (askie)   |   sanderkoning -@- kde -.- nl
KDE Nederland            |   http://www.kde.nl/
KOffice & Krita          |   http://koffice.org/  &  http://koffice.org/krita/
KDE documentation        |   http://docs.kde.org/
------------------------------------------------------------------------------


["signature.asc" (application/pgp-signature)]

_______________________________________________
kimageshop mailing list
kimageshop@kde.org
https://mail.kde.org/mailman/listinfo/kimageshop


[prev in list] [next in list] [prev in thread] [next in thread]