[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)

[Ryan Curtin]

> + * 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.

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.

---
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71806722
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160721/ed899203/attachment.html>