11 search results - page 1 / 3 » A Set Intersection Algorithm Via x-Fast Trie |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
SCALESPACE
1999
Springer
13 years 9 months ago
1999
Springer
Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
SMA
2010
ACM
13 years 5 months ago
2010
ACM
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...