52 search results - page 5 / 11 » Geometric Spanners for Weighted Point Sets |
IWPEC
2004
Springer
14 years 26 days ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
TIT
1998
13 years 7 months ago
1998
The order bound on generalized Hamming weights is introduced in a general setting of codes on varieties which comprises both the one point geometric Goppa codes as the q-ary Reed-M...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
IPL
2008
13 years 7 months ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...