Well, I'm not really trained to talk of such things, but one thing worth thinking of is how precise your method is trying to be. One of the reasons why Cage Transform is so slow is that it's trying to be too smart and does too much computation. The plan was to eventually start using poly2tri-C library that implements Delaunay triangulations. Does it ring a bell? I'm sure, Michael Muré can provide much more useful info :) Alexandre On Tue, Mar 12, 2013 at 1:36 AM, Marek Dvoroznak <dvoromar@xxxxxxxxx> wrote: > I have it currently written in Java and performance on fairly large > images isn't so good. I suppose that in C and with more optimizations it > will be much better. Performance and behavior of the algorithm very > depends on a size of mesh's squares (or triangles). I'll try to do some > performance tests. > > Marek > > On Mon, 11 Mar 2013 18:03:11 +0400, Alexandre Prokoudine wrote: >> So this is more like Puppet Warp really :) And it does look very impressive! >> >> IMHO, it would be a great GSoC project. >> >> How is it performance-wise? How well does it work on fairly large images? _______________________________________________ gimp-developer-list mailing list gimp-developer-list@xxxxxxxxx https://mail.gnome.org/mailman/listinfo/gimp-developer-list
