On Mon, Dec 07, 2009 at 03:59:12PM +0100, Artur Bodera wrote: > On Mon, Dec 7, 2009 at 2:08 PM, Michael Niedermayer <michae...@gmx.at>wrote: > > > The issue is just that with arbitrary graphs its not so > > easy to negotiate the format in a way that is scaleable and doesnt break > > down to O(2^n) time > > > > Just a friendly, novice, out-of-the-box suggestion from my side - how does > DirectX / DirectShow handle that?
I dont know, but if someone knows, iam interrested in that as well > Isn't it a common scenario or a common > problem that has already been resolved years ago? no, NP = P hasnt been proofen yet > I remember playing with > directshow filter graphs that were, in their complexity, way beyond what > we're considering here. The problem is not the graph complexity the problem is finding an optimal solution with few format convertions. You can trivially solve any graph by just inserting a format convertion filter between any 2 filters What our limitation allows us is finding a solution without convertion filters if such a solution exists no matter how complex the graph. And the overlay filter is the first that would be a little more convenient if that limitation didnt exist. [...] -- Michael GnuPG fingerprint: 9FF2128B147EF6730BADF133611EC787040B0FAB Rewriting code that is poorly written but fully understood is good. Rewriting code that one doesnt understand is a sign that one is less smart then the original author, trying to rewrite it will not make it better.
signature.asc
Description: Digital signature
_______________________________________________ FFmpeg-soc mailing list FFmpeg-soc@mplayerhq.hu https://lists.mplayerhq.hu/mailman/listinfo/ffmpeg-soc