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 to build a Hugo website in AWS Lambda and deploy it to S3

This tutorial explains how to run Hugo in AWS Lambda and deploy a static website to Amazon S3. Running Hugo in AWS Lambda can be useful if...