2021/03/20 by Gurpreet S. Kalsi, Kalsi, Gurpreet S., Steven B. Damelin +1
Computer Science · #52B05 #60F15 #62H30 #68T10 #94A08 #Computational Geometry (cs.CG) #Computer Vision and Pattern Recognition (cs.CV) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG) #cs.CG #cs.CV #cs.DS #cs.LG #msc:52B05 #msc:60F15 #msc:62H30 #msc:68T10 #msc:94A08
paper · pdf · doi:10.48550/arxiv.2103.11216
arxiv created 2021/05/16 · arxiv updated 2021/05/18
For s > 0, we consider an algorithm that computes all s-well separated pairs in certain point sets in ℝn, n >1. For an integer K >1, we also consider an algorithm that is a permutation of Dijkstra's algorithm, that computes K-nearest neighbors using a certain power weighted shortest path metric in ℝn, n > 1. We describe each algorithm and their respective dependencies on the input data. We introduce a way to combine both algorithms into a fused algorithm. Several open problems are given for future research.