✦ LIBER ✦

Randomized Data Structures for the Dynamic Closest-Pair Problem

✍ Scribed by Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel

Book ID: 118177415
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 544 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539794277718

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 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

Dynamic Rectangular Point Location, with

Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem

✍ M. Smid 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 760 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

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

An Optimized Divide-and-Conquer Algorith

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

✍ Pereira, José C.; Lobo, Fernando G. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB