I'm trying to solve exercises of the book "Computational Geometry in C" by O'Rourke. Could you please help me with this one?
Design an algorithm to find a line $L$ that:
- has all the points of a given set to one side
- minimizes the sum of the perpendicular distances of the points to $L$ Assume a hull algorithm is available.