English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Closest point problems in computational geometry

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

Item is

Files

show Files
hide Files
:
MPI-I-95-1-026.pdf (Any fulltext), 59MB
Name:
MPI-I-95-1-026.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Smid, Michiel1, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 1995
 Publication Status: Issued
 Pages: 62 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-1995-1-026
BibTex Citekey: Smid95
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -