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...
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...
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 ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
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...
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...