<div dir="ltr">Am I right to suppose that this is the code in LineIntersector.cpp<div><br></div><div>function LineIntersector::HasIntersection </div><blockquote style="margin:0 0 0 40px;border:none;padding:0px"><div>CGAlgorithms::orientationindex</div>
</blockquote><blockquote style="margin:0 0 0 40px;border:none;padding:0px"><blockquote style="margin:0 0 0 40px;border:none;padding:0px"><div>RobustDeterminant::SIgnOfDet2x2</div><div><br></div></blockquote></blockquote><div>
<br></div><div>Cheers,</div><div><br></div><div>Rémi-C</div></div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/11/6 Rémi Cura <span dir="ltr"><<a href="mailto:remi.cura@gmail.com" target="_blank">remi.cura@gmail.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">Hey,<div>I've been working on a ST_SnapPointToLine for the past week,</div><div>by reverse engineering when points are considered to be on line by st_intersect.</div>
<div><br></div><div>The (classic) problem is purely a numerical issue, and I suspect a problem in design of st_intersects.</div>
<div><br></div><div><br></div><div>So far my solution doesn't work for all line, can someone please point me in the right direction in GEOS so I can see if something can be improved regarding precision.</div><div><br>
</div><div>I know where the API is, but I'm looking for the exact part that decide if a point and a line intersects.</div><div><br></div><div>Cheers,</div><div><br></div><div>Rémi-C</div></div>
</blockquote></div><br></div>