when one wants to make cut from sqw object using generic projection, the complicated algorithm is deployed to calculate the intersection between original image and the target image. The intersection is used to identify what source image areas may contribute into target image ares and not to process the whole pixels which contribute to whole image.
Current algorithm which calculates this intersection is relatively complex and slow, so it may be improved. In addition, there are no proof that it takes all areas which may contribute to the target image correctly.
The purpose of this ticket is to improve the efficiency of the intersection algorithm and prove that it works correctly.
when one wants to make cut from sqw object using generic projection, the complicated algorithm is deployed to calculate the intersection between original image and the target image. The intersection is used to identify what source image areas may contribute into target image ares and not to process the whole pixels which contribute to whole image.
Current algorithm which calculates this intersection is relatively complex and slow, so it may be improved. In addition, there are no proof that it takes all areas which may contribute to the target image correctly.
The purpose of this ticket is to improve the efficiency of the intersection algorithm and prove that it works correctly.