Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
We examine analytical and numerical aspects of optimal control problems for firstorder elliptic systems in three dimensions. The particular setting we use is that of divcurl syste...
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
In this paper, we suggest a novel group delay based method for the onset detection of pitched instruments. It is proposed to approach the problem of onset detection by examining th...
Andre Holzapfel, Yannis Stylianou, Ali Cenk Gedik,...
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...