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:

The Y Combinator (Slight Return)

Tiger got to hunt, Bird got to fly; Lisper got to sit and wonder, (Y (Y Y))? Tiger got to sleep, Bird got to land; Lisper got to tell hims...