login/register

Snip!t from collection of Alan Dix

see all channels for Alan Dix

Snip
summary

Kd-Trees
figure8146
Input description: A set S of n points in k dimensions.
Problem description: Construct a tree that partitions th ...

Kd-Trees
http://www2.toki.or.id/book/AlgDesignManual/BOOK/BOOK3/NODE134.HTM

Categories

/Channels/algorithms

[ go to category ]

For Snip

loading snip actions ...

For Page

loading url actions ...

Kd-Trees

  

  figure8146

Input description: A set S of n points in k dimensions.

Problem description: Construct a tree that partitions the space by half-planes such that each point is contained in its own box-shaped region.

HTML

<h2><a name="SECTION03116000000000000000">Kd-Trees</a></h2> <p> <a name="kdtrees">&nbsp;</a><a name="8145">&nbsp;</a> </p><p><a name="kdtreesfig">&nbsp;</a> <img alt="figure8146" src="../BOOK25/IMG956.GIF" tppabs="http://evo.apm.tuwien.ac.at/AlgDesignManual/BOOK/BOOK25/IMG956.GIF" align="bottom" height="201" width="487"> </p><p> </p><p> <b>Input description</b>: A set <em>S</em> of <em>n</em> points in <em>k</em> dimensions. </p><p> <b>Problem description</b>: Construct a tree that partitions the space by half-planes such that each point is contained in its own box-shaped region.</p>