<div dir="ltr">Hi,<br><br>Here is my Haskell implementation of the <span class="citation" id="CITEREFShamosHoey1976">Shamos and </span><span class="citation" id="CITEREFShamosHoey1976">Hoey algorithm for detecting segments intersection in the plane:<br>
<br><a href="http://neonstorm242.blogspot.com/2010/12/sweep-line-algorithm-for-detection-of.html">http://neonstorm242.blogspot.com/2010/12/sweep-line-algorithm-for-detection-of.html</a><br><br>I'm new to Haskell, so any useful comments will be appreciated.<br>
<br>- Eran<br></span></div>