ausblenden:
Schlagwörter:
-
Zusammenfassung:
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.