We compute all translations resulting in the union of two finite, conv
ex sets being again convex. Convexity will be established by condition
s on the outside of the convex hull. Computations are of low degree po
lynomial bounds on the worst case number of steps. This results in a s
et estimator for a mobile robot's translation value.