𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Categorical Critical-pair Completion Algorithm

✍ Scribed by K. Stokkermans

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
554 KB
Volume
27
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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