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.
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...
Programmers almost always need the ability to find and replace certain text across multiple files in their projects. Most IDEs provide find ...
RecordRTC is a library that allows for client-side recording, using WebRTC. It's a fantastic tool (created and well-maintained by Muaz...
This is a guest post from Sacha Greif, co-author of Discover Meteor and creator of VulcanJS and Sidebar.