I wonder if anyone could test the GemUta microtile array implemenatation
(for dealing with dirty rectangles) with a more real-world project than
my tests are. The goal of Uta (Microtile array) is that you feed it with
a number of rectangles and you will get rectangles that cover the same
or little bigger area and don’t overlap.
I’d appreciate any answer, e.g. if it is faster or slower that you
current dirty rectangles management, etc.
The attachment contains the header and source file, licenced under LGPL.
P.S. The results of my tests were quite promising so I’d like to know if
it will prove so in the praxis too.
-------------- next part --------------
A non-text attachment was scrubbed…
Size: 4785 bytes
Desc: not available