The task has been done using pairwise checking, however yields O(n^2) complexity. Using an R-tree could improve it, however is yet to be done.
Description
Description
| Status | Assigned | Task | ||
|---|---|---|---|---|
| Open | earendil | T14574 Improved Bezier intersection algorithm | ||
| Resolved | earendil | T14681 Find all points of intersection between two QPainterPaths |