{"action":"created","issue":{"url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/141","repository_url":"https://api.github.com/repos/unibas-gravis/scalismo","labels_url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/141/labels{/name}","comments_url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/141/comments","events_url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/141/events","html_url":"https://github.com/unibas-gravis/scalismo/pull/141","id":164289853,"number":141,"title":"VantagePointTree: fast search in metric spaces","user":{"login":"sschoenborn","id":8012444,"avatar_url":"https://avatars.githubusercontent.com/u/8012444?v=3","gravatar_id":"","url":"https://api.github.com/users/sschoenborn","html_url":"https://github.com/sschoenborn","followers_url":"https://api.github.com/users/sschoenborn/followers","following_url":"https://api.github.com/users/sschoenborn/following{/other_user}","gists_url":"https://api.github.com/users/sschoenborn/gists{/gist_id}","starred_url":"https://api.github.com/users/sschoenborn/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sschoenborn/subscriptions","organizations_url":"https://api.github.com/users/sschoenborn/orgs","repos_url":"https://api.github.com/users/sschoenborn/repos","events_url":"https://api.github.com/users/sschoenborn/events{/privacy}","received_events_url":"https://api.github.com/users/sschoenborn/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":3,"created_at":"2016-07-07T11:41:46Z","updated_at":"2016-07-07T12:13:53Z","closed_at":null,"pull_request":{"url":"https://api.github.com/repos/unibas-gravis/scalismo/pulls/141","html_url":"https://github.com/unibas-gravis/scalismo/pull/141","diff_url":"https://github.com/unibas-gravis/scalismo/pull/141.diff","patch_url":"https://github.com/unibas-gravis/scalismo/pull/141.patch"},"body":"Added a [Vantage-Point Tree](https://en.wikipedia.org/wiki/Vantage-point_tree) for fast neighbour searches in metric spaces. The tree builds a binary space partition using the provided metric (which is exchangeable).\r\n\r\n**WARNING:** this only works for a metric (positive, symmetric and triangle inequality), see [Wikipedia](https://en.wikipedia.org/wiki/Metric_(mathematics))\r\n\r\nKey concept: at each node store a point and a radius, then split remaining points into an *inner* and *outer* set:\r\n\r\n- inner: all points which are closer to the node's point (=pivot) than radius\r\n- outer: all points which are farther away from the pivot than radius\r\n\r\n- Added to `scalismo.utils`\r\n- Recursive tree implementation for building and traversal\r\n- includes tests"},"comment":{"url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/comments/231060448","html_url":"https://github.com/unibas-gravis/scalismo/pull/141#issuecomment-231060448","issue_url":"https://api.github.com/repos/unibas-gravis/scalismo/issues/141","id":231060448,"user":{"login":"sschoenborn","id":8012444,"avatar_url":"https://avatars.githubusercontent.com/u/8012444?v=3","gravatar_id":"","url":"https://api.github.com/users/sschoenborn","html_url":"https://github.com/sschoenborn","followers_url":"https://api.github.com/users/sschoenborn/followers","following_url":"https://api.github.com/users/sschoenborn/following{/other_user}","gists_url":"https://api.github.com/users/sschoenborn/gists{/gist_id}","starred_url":"https://api.github.com/users/sschoenborn/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sschoenborn/subscriptions","organizations_url":"https://api.github.com/users/sschoenborn/orgs","repos_url":"https://api.github.com/users/sschoenborn/repos","events_url":"https://api.github.com/users/sschoenborn/events{/privacy}","received_events_url":"https://api.github.com/users/sschoenborn/received_events","type":"User","site_admin":false},"created_at":"2016-07-07T12:13:53Z","updated_at":"2016-07-07T12:13:53Z","body":"It is a different algorithm. The fast `closestPointOfSurface` use a *bounding volume* strategy which is a different thing. The Vantage-point tree is useful for closest-point retrieval in a point set."}}
{"actor":{"display_login":"sschoenborn"}}