GSoC/2021/StatusReports/TanmayChavan

From KDE Community Wiki

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!
Retrieved from "https://community.kde.org/index.php?title=GSoC/2021/StatusReports/TanmayChavan&oldid=92514"