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:

How can you work with a JSON value if you know nothing about it?

I have talked about the difficulty of typing certain JSON values coming from some APIs. The JSON is just very complicated. When I do that,...