GSoC/2021/StatusReports/TanmayChavan: Difference between revisions
(Krita - Smarter boolean operations on vector shapes) |
|||
| Line 1: | Line 1: | ||
== Krita - Smarter boolean operations on vector shapes == | == Krita - Smarter boolean operations on vector shapes == | ||
In Krita, performing boolean operations on vector shapes leads to a large number of unnecessary nodes. This happens because Qt lacks a proper algorithm to find the intersection point of two Bezier curves. I plan on implementing a numerically stable as well as efficient algorithm to find the intersections of two Bezier curves. | |||
== Progress until now == | |||
Hey! | |||
{{construction}} | |||
Revision as of 13:36, 13 July 2021
Krita - Smarter boolean operations on vector shapes
In Krita, performing boolean operations on vector shapes leads to a large number of unnecessary nodes. This happens because Qt lacks a proper algorithm to find the intersection point of two Bezier curves. I plan on implementing a numerically stable as well as efficient algorithm to find the intersections of two Bezier curves.
Progress until now
Hey!
| Under Construction |
|---|
| This is a new page, currently under construction! |