Closest point problems in computational geometry

Smid, Michiel

アイテム詳細

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

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

Closest point problems in computational geometry

MPS-Authors

Smid, Michiel
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.

フルテキスト (公開)

MPI-I-95-1-026.pdf
(全文テキスト（全般）), 59MB

付随資料 (公開)

There is no public supplementary material available

引用

Smid, M.(1995). Closest point problems in computational geometry (MPI-I-1995-1-026). Saarbrücken: Max-Planck-Institut für Informatik.

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

要旨

This is the preliminary version of a chapter that will appear in the {\em Handbook on Computational Geometry}, edited by J.-R.\ Sack and J.\ Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in $\IR^D$. In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail.