A parallel batch-dynamic data structure for the closest pair problem

DOI10.4230/LIPICS.SOCG.2021.60MaRDI QIDQ7234118zbMATH OpenFDO

Authors Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun

Publication date 27 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2021.60

zbMATH Keywords

parallel algorithmsdynamic algorithmsclosest pairexperimental algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 432753 (Why is no real title available?)
• scientific article; zbMATH DE number 432799 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 3569833 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 742974 (Why is no real title available?)
• scientific article; zbMATH DE number 910882 (Why is no real title available?)
• scientific article; zbMATH DE number 1424308 (Why is no real title available?)
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• A note on Rabin's nearest-neighbor algorithm
• A simple randomized sieve algorithm for the closest-pair problem
• An optimal algorithm for closest-pair maintenance
• An optimal algorithm for the on-line closest-pair problem
• Dynamization of order decomposable set problems
• Fast hierarchical clustering and other applications of dynamic closest pairs
• Geometric applications of a randomized optimization technique
• Introduction to algorithms.
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Multidimensional binary search trees used for associative searching
• Multidimensional divide-and-conquer
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• On the hardness and approximation of Euclidean DBSCAN
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Parallel algorithms for priority queue operations
• Parallel range, segment and rectangle queries with augmented maps
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
• The Parallel Evaluation of General Arithmetic Expressions
• Ultrafast Expected Time Parallel Algorithms

This page was built for publication: A parallel batch-dynamic data structure for the closest pair problem

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