28 lines
657 B
Markdown
28 lines
657 B
Markdown
|
---
|
||
|
|
title: "k-d Tree"
|
||
|
|
date: 2024-08-10T11:50:33+01:00
|
||
|
|
draft: false # I don't care for draft mode, git has branches for that
|
||
|
|
description: "Points in spaaaaace!"
|
||
|
|
tags:
|
||
|
|
- algorithms
|
||
|
|
- data structures
|
||
|
|
- python
|
||
|
|
categories:
|
||
|
|
- programming
|
||
|
|
series:
|
||
|
|
- Cool algorithms
|
||
|
|
favorite: false
|
||
|
|
disable_feed: false
|
||
|
|
---
|
||
|
|
|
||
|
|
The [_k-d Tree_][wiki] is a useful way to map points in space and make them
|
||
|
|
efficient to query.
|
||
|
|
|
||
|
|
I ran into them during my studies in graphics, as they are one of the
|
||
|
|
possible acceleration structures for [ray-casting] operations.
|
||
|
|
|
||
|
|
[wiki]: https://en.wikipedia.org/wiki/K-d_tree
|
||
|
|
[ray-casting]: https://en.wikipedia.org/wiki/Ray_casting
|
||
|
|
|
||
|
|
<!--more-->
|