Wednesday, November 22, 2017

Line Intersection using Bentley Ottmann Algorithm



Line intersection problem is a problem solved using line sweep technique. First , let us define the problem formally. Problem: Given a set of N line segments(2*N points), you need to find all intersections between these line segments.

No comments:

Fun With Haxl (Part 1)

This is a blog-post version of a talk I recently gave at the Haskell eXchange 2015. The video of the talk is here, but there were a lot of...