Halfplane Intersection problem

Table of ContentsIntroductionBrute ForceIncrementatal methodSorting and increment algorithmApplicationsOverviewIntroduction

In this article, we will be discussing how to compute the intersection of a set of halfplanes. A half plane can be defined as a planar region which consists of all points on one side of an infinite straight line, and none on the other side. We can apply computational geometry here, as an intersection can be represented as a convex polygon, where every point inside ...