de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45339

Saluja,  Sanjeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44551

Gupta,  Prosenjit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1996-1-022
(Any fulltext), 10KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Saluja, S., & Gupta, P.(1996). Optimal algorithms for some proximity problems on the Gaussian sphere with applications (MPI-I-1996-1-022). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-A413-E
Abstract
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.