Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
Ordinarily, a robot workspace has insufficientroom to allow the setup of multiple applications simultaneously. As a result, it is common practice to use modular fixtures which hol...
Detection of lines in noisy image is not easy. When using Hough transform, multiple false peaks may be generated from collinear noisy edge points, which in turn may create false l...
Arturo Sanchez-Azofeifa, Jun Zhou, Walter F. Bisch...
Abstract. A method fully utilizing multiscale line filter responses is presented to estimate the point spread function (PSF) of a CT scanner and diameters of small tubular structur...
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...