New Techniques for Exact and Approximate Dynamic Closest-Point Problems
From MaRDI portal
Recommendations
Cited in
(20)- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- A cell probe lower bound for dynamic nearest-neighbour searching
- Searching dynamic point sets in spaces with bounded doubling dimension
- Fully retroactive approximate range and nearest neighbor searching
- On locality-sensitive orderings and their applications
- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets
- scientific article; zbMATH DE number 2038782 (Why is no real title available?)
- scientific article; zbMATH DE number 2149349 (Why is no real title available?)
- scientific article; zbMATH DE number 2119699 (Why is no real title available?)
- scientific article; zbMATH DE number 910882 (Why is no real title available?)
- scientific article; zbMATH DE number 1424308 (Why is no real title available?)
- Dynamic closest pairs — A probabilistic approach
- New bounds for range closest-pair problems
- scientific article; zbMATH DE number 5046292 (Why is no real title available?)
- Efficient regular data structures and algorithms for dilation, location, and proximity problems
- On bounded leg shortest paths problems
- Dynamic approximate multiplicatively-weighted nearest neighbors
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
- A parallel batch-dynamic data structure for the closest pair problem
This page was built for publication: New Techniques for Exact and Approximate Dynamic Closest-Point Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895830)
