<p>In <a href="https://github.com/mlpack/mlpack/pull/708#discussion_r71806722">src/mlpack/core/tree/vantage_point_tree/vantage_point_tree.hpp</a>:</p>
<pre style='color:#555'>> + * Definition of the vantage point tree.
> + */
> +
> +#ifndef MLPACK_CORE_TREE_VANTAGE_POINT_TREE_VANTAGE_POINT_TREE_HPP
> +#define MLPACK_CORE_TREE_VANTAGE_POINT_TREE_VANTAGE_POINT_TREE_HPP
> +
> +#include "vantage_point_split.hpp"
> +
> +namespace mlpack {
> +namespace tree /** Trees and tree-building procedures. */ {
> +
> +/**
> + * The vantage point tree is a variant of a binary space tree. The difference
> + * from BinarySpaceTree is a presence of points in intermediate nodes.
> + * If an intermediate node holds a point, this point is the centroid of the
> + * bound.
</pre>
<p>We should probably reference Peter Yianilos's paper here (and possibly Jeffrey Uhlmann's too), and point out that the vantage point tree and the metric tree are the same thing.</p>
<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">—<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly, <a href="https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71806722">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe-auth/AJ4bFHajIRSK4ebD4szdE1V7Vc7e_8c_ks5qYALugaJpZM4I_COp">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFA4-JGwjg6cqVzHj6dPIVGWuD4Ipks5qYALugaJpZM4I_COp.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
<div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
<link itemprop="url" href="https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71806722"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>