23 lines
574 B
Markdown
23 lines
574 B
Markdown
|
---
|
||
|
|
title: "Kd Tree Revisited"
|
||
|
|
date: 2024-08-17T14:20:22+01:00
|
||
|
|
draft: false # I don't care for draft mode, git has branches for that
|
||
|
|
description: "Simplifying the nearest neighbour search"
|
||
|
|
tags:
|
||
|
|
- algorithms
|
||
|
|
- data structures
|
||
|
|
- python
|
||
|
|
categories:
|
||
|
|
- programming
|
||
|
|
series:
|
||
|
|
- Cool algorithms
|
||
|
|
favorite: false
|
||
|
|
disable_feed: false
|
||
|
|
---
|
||
|
|
|
||
|
|
After giving it a bit of thought, I've found a way to simplify the nearest
|
||
|
|
neighbour search (i.e: the `closest` method) for the `KdTree` I implemented in
|
||
|
|
[my previous post]({{< relref "../2024-08-10-kd-tree/index.md" >}}).
|
||
|
|
|
||
|
|
<!--more-->
|