Hi Jeffrey, the algorithm uses Dijkstra's algorithm with a priority queue, so the maximum time complexity involved in finding the cut itself should be somewhere around O(n log(n) + e), n being the number of pixels in the overlap region and e being the number of edges in the graph used (since pixels are 4-connected nodes in the graph, worst case here would be O(n log(n) + 4n)). That said, it usually completes calculations in a reasonable time even with a fine mask. You can always test and compare with the old algorithm if in doubt.
Best regards, Mikolaj On 30 Wrz, 14:45, Jeffrey Martin <[email protected]> wrote: > How big do you mean? Can it blend an arbitrarily large image? I mean, does > the time scale linearly? > > Jeffrey -- You received this message because you are subscribed to the Google Groups "Hugin and other free panoramic software" group. A list of frequently asked questions is available at: http://wiki.panotools.org/Hugin_FAQ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/hugin-ptx
