Edvin Berglin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using curves with d degrees of freedom. Another generalization is the Hyperplane Cover problem where points in d-dimensional(More)
  • 1