Dilation operation explores graph without valid upper bound

[dbahrdt]

In order to support the dilation operation we simply explore the neighborhood graph. However we need to have a valid upper bound up to which distance we need to explore the neighborhood in the graph. In the triangulation this is easier (dt is a geometric spanner, problem: constrained edges).
Additionally we don't calculate the distance correctly but use various kinds of approximations.