7351 search results - page 61 / 1471 » Segmenting Point Sets |
CIAC
2006
Springer
14 years 1 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...
JGAA
2006
13 years 10 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
DCG
2006
13 years 10 months ago
2006
Let B be a Borel set in Ed with volume V (B) = . It is shown that almost all lattices L in Ed contain infinitely many pairwise disjoint d-tuples, that is sets of d linearly indepen...
DAM
2011
13 years 5 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
DCG
2010
13 years 7 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...