sentences:  Banach–Mazur distance).Low-dimensional problems have lower computational complexity, of course.More importantly, if the problems embed well in either the Euclidean plane or the three-dimensional Euclidean space, then geometric algorithms become exceptionally fast.