Fixed-Radius Near Neighbors Search
Explore this paper's citation graph
Summary
An algorithm for the fixed-radius near neighbors search problem for points in the planr with a preprocessing of time O(nlogn) and space O(n) is presented, which improves an algorithm presented recently by Dickerson and Drysdale.
- Type
- article
- Published
- 1991-09-01
- Cited by
- 18
- References
- 3
- OpenAlex
- https://openalex.org/W2022072413
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9204989
Keywords
RADIUS, Combinatorics, Mathematics, Time complexity, Preprocessor
References
Cited by
- Planification de trajectoires de robots mobiles non-holonomes et de robots à pattes. (Motion planning of non-holonomic mobile robots and legged robots)
- Scalability of fixed-radius searching in meshless methods for heterogeneous architectures
- Finding k-Closest-Pairs Efficiently for High Dimensional Data
- Motion Planning of Legged Robots
- Predictions of biochar production and torrefaction performance from sugarcane bagasse using interpolation and regression analysis.
- Fast discrete convolution in R^2 using Sparse Bessel Decomposition
- Fast discrete convolution in ℝ2R^2 with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
- Efficient methods for acoustic scattering in 2 and 3 dimensions : preconditioning on singular domains and fast convolution.
- CACTUS: a computational framework for generating realistic white matter microstructure substrates
- SpaNCMG: improving spatial domains identification of spatial transcriptomics using neighborhood-complementary mixed-view graph convolutional network
- A Study on Cell-Based Algorithms for Nearest-Neighbor Search between Hexagonal Clusters
- Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
- Consistency-Constrained Contrastive Learning with Hard-Negative for Spatial Domain Identification
- An Adaptive Framework for Medical Image Clustering-Based Brain Tumor Classification Using Transfer Learning
- Cheesemap: A high-performance point-indexing data structure for neighbor search in LiDAR data
- Quantum Algorithm for the Fixed-Radius Neighbor Search
- OTOMATISASI PENJADWALAN MISI PENGAMATAN MEDAN MAGNET BUMI LAPAN-A3 MENGGUNAKAN METODE FIXED- RADIUS NEAR NEIGHBORS AUTONOMOUS LAPAN-A3 EARTH MAGNETIC FIELD OBERSAVTION MISSION SCHEDULING BY USING FIXED-RADIUS NEAR NEIGHBORS METHOD
- MOTION PLANNING OF LEGGED ROBOTS (cid:3)
Related papers
- Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning
- On the Steiner antipodal number of graphs
- Preprocessing Algorithms for Filtering Airborne LiDAR Data
- SPLIT: Smart Preprocessing (Quasi) Language Independent Tool
- An information-measurement system for preprocessing of photofluorographic images
- Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
- A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata