GSoC/2021/StatusReports/TanmayChavan: Difference between revisions
| Line 2: | Line 2: | ||
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. | 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. | ||
== Mentors == | |||
* Iván Santa María | |||
* Dmitry Kazakov | |||
== Goals == | == Goals == | ||
Revision as of 15:51, 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.
Mentors
- Iván Santa María
- Dmitry Kazakov
Goals
- Create a new algorithm to compute intersections of Bezier curves using implicitization
- done!
- Manage the dependencies and implement parts of Qt private modules in Krita codebase
- done!
- Integrate the algorithm with current intersection finding routine
- pending
- Implement the new routine for boolean operations
- pending
- Write proper documentation and unit tests for all the above goals while doing them
- ongoing
Progress until now
Hey!
| Under Construction |
|---|
| This is a new page, currently under construction! |