✦ LIBER ✦

Pyramid computer solutions of the closest pair problem

✍ Scribed by Quentin F Stout

Book ID: 103628155
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 737 KB
Volume: 6
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(85)90038-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Plane-sweep solves the closest pair prob

Plane-sweep solves the closest pair problem elegantly

✍ Klaus Hinrichs; Jurg Nievergelt; Peter Schorn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 796 KB

A fast parallel algorithm for the closes

A fast parallel algorithm for the closest pair problem

✍ Charles R. Dyer 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 506 KB

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

Randomized Data Structures for the Dynam

Randomized Data Structures for the Dynamic Closest-Pair Problem

✍ Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 544 KB

A Simple Randomized Sieve Algorithm for

A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

✍ S. Khuller; Y. Matias 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 337 KB

An optimal algorithm for the on-line clo

An optimal algorithm for the on-line closest-pair problem

✍ C. Schwarz; M. Smid; J. Snoeyink 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 712 KB