I imagine in that line of work, SW must consist of like 99% safeguards and checks of various kinds. Like rather double-check the thing the compiler already proved at runtime than discovering a rare compiler bug in 10 years during a complex oribital descent maneuver…

Have to reboot every 136 years, literally unusable.

Nice walkthrough of how to extend your python with rust and what to watch out for to actually speed things up, thanks!

Not sure whether this is just a property of your toy example (and not the original code), but it may be worth pointing out to future readers that the “finding close polygons” part can in practice likely be sped up drastically with some spatial data structure (eg spatial hashing or a k-d-tree).