scientific article; zbMATH DE number 794264

MaRDI QIDQ4847025zbMATH OpenFDO

Authors V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Publication date 28 May 1996

zbMATH Keywords

closest foreign pair

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1383812
• A simple randomized O(N N)-time closest-pair algorithm in doubling metrics
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• A Reliable Randomized Algorithm for the Closest-Pair Problem

Cited in

(10)

• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
• A simple randomized O(N N)-time closest-pair algorithm in doubling metrics
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• Dominance product and high-dimensional closest pair under \(L_\infty\)
• Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• Colored range closest-pair problem under general distance functions
• A simple randomized sieve algorithm for the closest-pair problem
• Automata, Languages and Programming
• Closest pair and the post office problem for stochastic points

This page was built for publication:

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