Efficient randomized incremental algorithm for the closest pair problem using Leafary trees

DOI10.1007/bfb0030821zbMath1527.68247OpenAlexW1596775411MaRDI QIDQ6064016

C. Pandu Rangan, Kamala Krithivasan, V. Kamakoti

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030821

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Rabin's nearest-neighbor algorithm
• A simple randomized sieve algorithm for the closest-pair problem
• A Reliable Randomized Algorithm for the Closest-Pair Problem

This page was built for publication: Efficient randomized incremental algorithm for the closest pair problem using Leafary trees