999 search results - page 15 / 200 » Finding shapes in a set of points |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...