A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Covering Points with Minimum Turns
2015
International journal of computational geometry and applications
The problem of covering a set of points by a minimum number of lines is one of the oldest problems in computational geometry. • Megiddo and Tamir (1982) proved that the line cover problem is NP-hard even in R 2 . Axis-parallel Lines For the rectilinear version of the problem in which the lines must be axis-parallel, • Hassin and Megiddo (1991) observed that the problem in R 2 reduces to vertex cover in bipartite graphs and hence is solvable in polynomial time, and proved that the problem in R 3
doi:10.1142/s0218195915500016
fatcat:doe4blchxjagzc65r3ragl6zxu