Using particles to sample and control implicit surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
SIAM Journal on Numerical Analysis
Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis
Computer Aided Geometric Design
Finding elliptic Fekete points sets: two numerical solution approaches
Journal of Computational and Applied Mathematics
Energy functionals, numerical integration and asymptotic equidistribution on the sphere
Journal of Complexity
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Journal of Computational Physics
Short note: A spherical code and stress tensor inversion
Computers & Geosciences
Hi-index | 31.45 |
Here, we study the computational complexity of the Fekete point problem. Namely, we give an exhaustive description of the main properties of an algorithm for the minimization of the logarithmic potential energy on the 2-sphere, and we characterize the probability distribution of the cost of the different minima. In particular, we show that a local minimum can be found with an average cost of about O(N^2^.^8).