๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast parallel algorithm for the closest pair problem

โœ Scribed by Charles R. Dyer

Book ID
113162199
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
506 KB
Volume
11
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Reliable Randomized Algorithm for the
A Reliable Randomized Algorithm for the Closest-Pair Problem
โœ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an ร„ 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

A note concerning the closest point pair
A note concerning the closest point pair algorithm
โœ Martin Richards ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 43 KB

An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove this it is necessary to show that, in the merge phase of the algorithm, no more than a constant number of distances need t