MPI-I-96-1-022. September 1996, 8 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|