Optimal algorithms for some proximity problems on the Gaussian sphere with applications
Sanjeev Saluja, Prosenjit Gupta · MPG.PuRe (Max Planck Society) · 1996
We consider some geometric problems on the unit sphere which arise in $NC$-machining. Optimal linear time algorithms are given for these problems using linear and quadratic programming in three dimensions.