Hi Quentin,<br><br>"Union" method will split self-intersection linestring.<br><br>[Input]<br>A:LINESTRING(0 0, 100 100, 0 100, 100 0)<br>B:POINT(0 0)<br>- B is a one node of A.<br><br>Result = A.Union(B)<br><br>[Output]<br>
Result:MULTILINESTRING ((0 0, 50 50), (50 50, 100 100, 0 100, 50 50), (50 50, 100 0))<br><br>Refer to the document "FOSS4G 2007 : Secrets of the JTS Topology Suite"<br>(<a href="http://www.foss4g2007.org/presentations/view.php?abstract_id=115">http://www.foss4g2007.org/presentations/view.php?abstract_id=115</a> )<br>
for details.<br><br>Regards,<br><br>Sanak.<br><br><div class="gmail_quote">2009/4/21 Quentin VUILLIOT <span dir="ltr"><<a href="mailto:q.vuilliot@gmail.com">q.vuilliot@gmail.com</a>></span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hello everyone,<br>
<br>
I'm not sure this is the right place to post such a question, but I<br>
can't find any other Geos mailing-list or forum. So please excuse me<br>
if I'm wrong here.<br>
<br>
I can't find a way of splitting a linestring that intersects itself<br>
into several linestrings that don't. I'm surprised not to find any<br>
clues about that on the web, though it seems to me that it should be a<br>
rather common problem, isn't it?<br>
I mean, there is a function to determine whether a linestring is<br>
simple or not, but nothing to do more with it, like locate the<br>
intersection points?<br>
<br>
Thank you in advance for your answers<br>
<br>
Quentin<br>
_______________________________________________<br>
geos-devel mailing list<br>
<a href="mailto:geos-devel@lists.osgeo.org">geos-devel@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/geos-devel" target="_blank">http://lists.osgeo.org/mailman/listinfo/geos-devel</a><br>
</blockquote></div><br>