A note concerning the closest point pair algorithm.
type: Item
instance of: scholarly article
title: A note concerning the closest point pair algorithm.
zbMATH Open document ID: 1043.68116
DOI: 10.1016/S0020-0190(01)00268-X
author: Martin Richards
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1856357
zbMATH Keywords: Closest point pair algorithm
zbMATH Keywords: Mergesort
zbMATH Keywords: Analysis of algorithms
MaRDI profile type: Publication
cites work: Q3619797
cites work: Q4023849
full work available at URL: s0020-0190(01)00268-x
OpenAlex ID: W2089092697
Recommended article: An improved algorithm for finding the closest pair of points
Recommended article: A Randomized Algorithm for Closest-Point Queries
Recommended article: A new algorithm for finding closest pair of vectors (extended abstract)
Recommended article: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
Recommended article: Q4945521
Recommended article: Verification of Closest Pair of Points Algorithms
Recommended article: On the Complexity of Closest Pair via Polar-Pair of Point-Sets
description: scientific article; zbMATH DE number 1856357