Extracting Similar Data: Using K-D Trees to Efficiently Locate Nearest Neighbors

Finding points of similar location using k-dimensional trees in large datasets — in this case geospatial (latlon) centroids

Daniel Ellis Research

--

Photo by Kunj Parekh on Unsplash

Introduction

--

--

Daniel Ellis Research

Research Software Engineer specialising in High-Performance Computing and Data Visualisation. — PhD in Atmospheric Chemistry and Masters in Theoretical Physics.