A critical bug has been discovered recently in the ellipsoid tesselation feature (see issue 792).
This bug may generate an infinite loop in very rare cases due to numerical noises when computing the difference of two very close lines in geographical zones of interest. The bug was discovered by a operational project using a very old Orekit version (7.x) and Apache Commons Math. It was not possible to reproduce this specific case with current version, but looking at the code, it is nevertheless possible that it happens again.
As the result of the bug is an infinite loop, it is considered critical, therefore I will fix this by adding a simple hard-coded iteration limit. The loop should generally converge in one iteration for path-connected zones and n iterations for zones composed of n path-connected zones, like for example an arpichelago where each island would be modeled, so setting a limit to something like 1000 iterations just as a safety feature seems sufficient.
Once the fix is available (most probably tomorrow), I will publish the patch release, according to section 2.2.4 in Orekit governance that specify the process for urgent patch releases. This urgent process occurs mainly on the developers lists which takes responsibility for the release. I have already notified the PMC who could ask for a more formal vote in the next 24 hours.
So this message is intended mainly to notify developers. The only change between Orekit 10.3 and Orekit 10.3.1 will be this fix.
What do developers think?