The computational algorithms of basic general geometry have a double exponential worst case complexity .
The basic general algorithms of computational geometry have a double exponential worst case complexity .