Hi Sergey,

On 22-7-2011 16:07, Sergei Politov wrote:

Hi Barend,

It is. It did not use the concept at that point. After inspecting I remembered why, and it is fixed now (in Boost.Trunk).

Thanks for a quick fix.

You are welcome.

Some more questions.

Am I correctly understand that intersection of segment and ring is not implemented yet?

That is correct. If you mean "cutting a ring with a segment": it can be used/implemented, discussed and described on the GGL-mailing list. That might be useful for you as well. It is described here:
<http://boost-geometry.203548.n3.nabble.com/Understanding-get-turns-for-linestring-polygon-overlay-td2397891.html>

There is distance algorithm between point and segment (or ring), is it possible to get closest point of segment to that point?

No, or not yet. I once needed that and created a strategy for that, but it is not in the Trunk or Release (not even in the extensions). I will see if it can be added, because there has been a question about this earlier.

Regards, Barend