Talk:Vantage-point tree

Proposed merge with MVP tree

MVP tree is a generalization of the better-known VP tree. It can be adequately covered in the more complete Vantage-point tree article. Pburka (talk) 22:29, 16 November 2014 (UTC)

 Done JackPotte (talk) 00:06, 30 January 2016 (UTC)

I added notes about Brin's GNAT data structure, which is related to the MVP. Brin's paper: http://www.vldb.org/conf/1995/P574.PDF --Ericjster (talk) 00:59, 29 January 2019 (UTC)

Desired New Sections

Algorithms are missing: a construction algorithm as well as a nearest neighbor search algorithms would be welcome. Also, a search for all neighbors within a tolerance margin would be welcome. 160.129.138.225 (talk) 15:04, 23 March 2017 (UTC)

Each variant has some differences in the construction, and those details often can be important in practice. The construction algorithm should generalize the different variations. --Ericjster (talk) 00:59, 29 January 2019 (UTC)

I think more should be said about metric spaces, and all you need is a function to compare two things. For example one can create an index on text or pictures, and the user only needs to provide a distance function. The distance function must maintain the triangle inequality. --Ericjster (talk) 00:59, 29 January 2019 (UTC)