Finding the intersections of straight lines

202 Views Asked by At

Given a set of lines intersecting the quadrant with $x, y>0$, what are the available algorithms for finding the area below all straight lines (including $y$ and $x$ axis)? In other words, methods to find the points of the polygon given be the intersections of the lines?

1

There are 1 best solutions below

2
On BEST ANSWER

If I understand the question, you can compute the polygon you are interested in by dualizing, computing the convex hull, and then going back. This is pretty standard course material, e.g., http://www.cs.umd.edu/class/spring2012/cmsc754/Lects/lect08.pdf