To comment on the following update, log in, then open the issue: http://www.openoffice.org/issues/show_bug.cgi?id=107360
------- Additional comments from h...@openoffice.org Thu Dec 3 08:23:39 +0000 2009 ------- It would be interesting to compare the algorithmic complexity of this decomposer that tries to do clipping, self-intersections, cross-intersections, bezier-decomposition etc. all at once with one that uses generic clipping, generic intersection tests, and generic trapezoid decomposition (e.g. with Bentley-Ottmann). AFAIK it should be about the same. This would require that the generic methods in basegfx would also have good algorithmic complexity such as O(n*log n) though, which is unfortunately not always the case yet. --------------------------------------------------------------------- Please do not reply to this automatically generated notification from Issue Tracker. Please log onto the website and enter your comments. http://qa.openoffice.org/issue_handling/project_issues.html#notification --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@graphics.openoffice.org For additional commands, e-mail: issues-h...@graphics.openoffice.org --------------------------------------------------------------------- To unsubscribe, e-mail: allbugs-unsubscr...@openoffice.org For additional commands, e-mail: allbugs-h...@openoffice.org
