scientific article; zbMATH DE number 910882

MaRDI QIDQ4886056zbMATH OpenFDO

Authors Paul B. Callahan, S. R. Kosaraju

Publication date 4 November 1996

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• An optimal algorithm for closest-pair maintenance
• Dynamic closest pairs — A probabilistic approach
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields

Cited in

(11)

• Chromatic nearest neighbor searching: A query sensitive approach
• Conic nearest neighbor queries and approximate Voronoi diagrams
• Deformable spanners and applications
• Online timestamped text indexing
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• scientific article; zbMATH DE number 2038782 (Why is no real title available?)
• scientific article; zbMATH DE number 2149349 (Why is no real title available?)
• Topology B-trees and their applications
• Energy-efficient paths in radio networks
• A parallel batch-dynamic data structure for the closest pair problem
• I/O-efficient algorithms for computing planar geometric spanners

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 Q4886056)