scientific article; zbMATH DE number 910882
From MaRDI portal
zbMATH Open0849.68091MaRDI QIDQ4886056FDOQ4886056
Authors: Paul B. Callahan, S. R. Kosaraju 
Publication date: 4 November 1996
Title of this publication is not available (Why is that?)
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
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Parallel algorithms in computer science (68W10)
Cited In (9)
- Chromatic nearest neighbor searching: A query sensitive approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online timestamped text indexing
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Energy-efficient paths in radio networks
- Topology B-trees and their applications
- Deformable spanners and applications
- 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)
