<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title>Snipplr</title>
<link>http://snipplr.com/language/clojure/tags/k-d</link>
<description>Recent snippets posted on Snipplr.com</description>
<language>en-us</language>
<pubDate>Thu, 23 May 2013 11:58:48 GMT</pubDate>
<item>
<title>(Clojure) k-d tree - weilawei</title>
<link>http://snipplr.com/view/64805/kd-tree/</link>
<description><![CDATA[ <p>make-kd-node [median left right]: Creates a node in a kd-tree.

make-kd-tree [k depth points]: Creates a kd-tree of kd-nodes. **TODO**: Not stack safe. Use loop/recur.

kd-nearest-neighbor [a-point kd-tree]: Returns the nearest neighboring point to a given point, using a kd-tree.</p> ]]></description>
<pubDate>Mon, 07 May 2012 00:51:46 GMT</pubDate>
<guid>http://snipplr.com/view/64805/kd-tree/</guid>
</item>
</channel>
</rss>