Randomized Data Structures for the Dynamic Closest-Pair Problem

DOI10.1137/S0097539794277718zbMATH Open0907.68188OpenAlexW2025341672MaRDI QIDQ4210083FDOQ4210083

Authors: Rajeev Raman, Mordecai J. Golin, Christian Schwarz, Michiel Smid 

Publication date: 20 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794277718

Recommendations

• scientific article; zbMATH DE number 437555
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• scientific article; zbMATH DE number 1383812
• A Randomized Algorithm for Closest-Point Queries
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
• A simple randomized sieve algorithm for the closest-pair problem
• scientific article; zbMATH DE number 794264
• A simple randomized \(O(N\log N)\)-time closest-pair algorithm in doubling metrics

zbMATH Keywords

randomizationcomputational geometryproximitydynamic data structures

Mathematics Subject Classification ID

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

Cited In (13)

• Dynamic closest pairs — A probabilistic approach
• Title not available (Why is that?)
• Efficient regular data structures and algorithms for dilation, location, and proximity problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• A simple randomized sieve algorithm for the closest-pair problem
• Deferred data structure for the nearest neighbor problem
• Kinetic data structures for all nearest neighbors and closest pair in the plane
• Dynamic rectangular point location, with an application to the closest pair problem
• Fast hierarchical clustering and other applications of dynamic closest pairs
• A Randomized Algorithm for Closest-Point Queries
• Title not available (Why is that?)

This page was built for publication: Randomized Data Structures for the Dynamic Closest-Pair Problem

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