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:

JavaScript Event Loop Explained

Now for the long answer, let me try through 2 sample code snippets. Here we have the main function which has 2 console.log commands loggin...