Dynamic closest pairs — A probabilistic approach

DOI10.1007/3-540-55706-7_31MaRDI QIDQ5056153zbMATH OpenOpenAlexFDO

Authors Mordecai J. Golin

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55706-7_31

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1303605
• Fast hierarchical clustering and other applications of dynamic closest pairs
• scientific article; zbMATH DE number 437555
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Automata, Languages and Programming
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• scientific article; zbMATH DE number 7559380
• Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems

Cites work

• scientific article; zbMATH DE number 432799 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3954145 (Why is no real title available?)
• scientific article; zbMATH DE number 3692659 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3564899 (Why is no real title available?)
• scientific article; zbMATH DE number 1241849 (Why is no real title available?)
• A guided tour of Chernoff bounds
• An optimal algorithm for the on-line closest-pair problem
• Optimal Expected-Time Algorithms for Closest Point Problems
• The design of dynamic data structures

Cited in

(11)

• A Clustering-Based Approach to Kinetic Closest Pair
• scientific article; zbMATH DE number 910882 (Why is no real title available?)
• Dynamic proximity calculations for situation awareness
• scientific article; zbMATH DE number 742974 (Why is no real title available?)
• The average performance analysis of a closest‐pair algorithm
• scientific article; zbMATH DE number 437555 (Why is no real title available?)
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Dynamic rectangular point location, with an application to the closest pair problem
• Closest pair and the post office problem for stochastic points
• Fast hierarchical clustering and other applications of dynamic closest pairs
• scientific article; zbMATH DE number 2119699 (Why is no real title available?)

This page was built for publication: Dynamic closest pairs — A probabilistic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056153)