MPI-I-96-1-022
Optimal algorithms for some proximity problems on the Gaussian sphere with applications
Saluja, Sanjeev and Gupta, Prosenjit
September 1996, 8 pages.
.
Status: available - back from printing
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.
-
- Attachement: MPI-I-96-1-022.ps (137 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1996-1-022
BibTeX
@TECHREPORT{SalujaGupta96,
AUTHOR = {Saluja, Sanjeev and Gupta, Prosenjit},
TITLE = {Optimal algorithms for some proximity problems on the Gaussian sphere with applications},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-96-1-022},
MONTH = {September},
YEAR = {1996},
ISSN = {0946-011X},
}