Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-96-1-022

Optimal algorithms for some proximity problems on the Gaussian sphere with applications

Saluja, Sanjeev and Gupta, Prosenjit

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.

Acknowledgement:
References to related material:


To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-96-1-022.ps137 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1996-1-022
Hide details for BibTeXBibTeX
@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},
}