English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  An O(n log n log log n) algorithm for the on-line closes pair problem

Schwarz, C., & Smid, M.(1991). An O(n log n log log n) algorithm for the on-line closes pair problem (MPI-I-91-107). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-7B0B-9 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-9531-3
Genre: Report

Files

show Files
hide Files
:
MPI-I-91-107.pdf (Any fulltext), 12MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-002D-9532-1
Name:
MPI-I-91-107.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Schwarz, Christian1, Author           
Smid, Michiel1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Let $V$ be a set of $n$ points in $k$-dimensional space. It is shown how the closest pair in $V$ can be maintained under insertions in $O(\log n \log\log n)$ amortized time, using $O(n)$ space. Distances are measured in the $L_{t}$-metric, where $1 \leq t \leq \infty$. This gives an $O(n \log n \log\log n)$ time on-line algorithm for computing the closest pair. The algorithm is based on Bentley's logarithmic method for decomposable searching problems. It uses a non-trivial extension of fractional cascading to $k$-dimensional space. It is also shown how to extend the method to maintain the closest pair during semi-online updates. Then, the update time becomes $O((\log n)^{2})$, even in the worst case.

Details

show
hide
Language(s): eng - English
 Dates: 1991
 Publication Status: Issued
 Pages: 21 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-91-107
BibTex Citekey: SchwarzSmid91
 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: -