13 citations · 13 across the 1 of their papers we have counts for
2 papers
cs.CG2024★ 1 cited
A simple linear time algorithm for smallest enclosing circles on the (hemi)sphere
Jens Flemming
Based on Welzl's algorithm for smallest circles and spheres we develop a simple linear time algorithm for finding the smallest circle enclosing a point cloud on a sphere. The algor…
math.FA2015★ 13 cited
On -regularization in light of Nashed's ill-posedness concept
Jens Flemming, Bernd Hofmann, Ivan Veselic
Based on the powerful tool of variational inequalities, in recent papers convergence rates results on -regularization for ill-posed inverse problems have been formulated in…