[Lib2geom-devel] Maximum distance between curves

[Krzysztof K. <twe...@gm...>]

For the new Boolean operations algorithm, I could use a routine which
calculates the following: Given two curves, or even better two
sequences of curves, find a time value on one of them that maximizes
the distance from the other. In other words, I want to find t on c1
such that the distance from c1.poinAt(t) to the nearest point on c2 is
maximal. It can be assumed that the endpoints of both curve sequences
are exactly equal.

Is there some clever way to calculate this?

I need this to determine whether the fragments of paths between two
intersections are sufficiently similar to one another that they can be
considered the same. Or perhaps someone has a better idea on how to
resolve degeneracies in the Greiner-Hormann algorithm (now implemented
in intersection-graph.cpp)? The paper by Foster and Overfelt does not
easily generalize from polygons to paths:
http://arxiv.org/pdf/1211.3376v1.pdf

Regards, Krzysztof