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

Saluja, Sanjeev; Gupta, Prosenjit

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1827377_4

詳細要約

公開

報告書

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

MPS-Authors

/persons/resource/persons45339

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

/persons/resource/persons44551

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

1996-1-022
(全文テキスト（全般）), 10KB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-A413-E

要旨

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.