The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
This paper considers the problem of construction of low-pass filters on the unit sphere, which has wide ranging applications in the processing of signals on the unit sphere. We p...
Zubair Khalid, Salman Durrani, Rodney A. Kennedy, ...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
Complex shapes - such as the surface of the human brain may be represented and analyzed in frequency space by a spherical harmonics transformation. A key step of the processing ch...
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro