From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail3-relais-sop.national.inria.fr (mail3-relais-sop.national.inria.fr [192.134.164.104]) by sympa.inria.fr (Postfix) with ESMTPS id 8B1AF82355 for ; Wed, 7 Feb 2018 13:40:20 +0100 (CET) Authentication-Results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=ivg@ieee.org; spf=Pass smtp.mailfrom=ivg@ieee.org; spf=None smtp.helo=postmaster@mail-lf0-f45.google.com Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of ivg@ieee.org) identity=pra; client-ip=209.85.215.45; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="ivg@ieee.org"; x-sender="ivg@ieee.org"; x-conformance=sidf_compatible Received-SPF: Pass (mail3-smtp-sop.national.inria.fr: domain of ivg@ieee.org designates 209.85.215.45 as permitted sender) identity=mailfrom; client-ip=209.85.215.45; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="ivg@ieee.org"; x-sender="ivg@ieee.org"; x-conformance=sidf_compatible; x-record-type="v=spf1" Received-SPF: None (mail3-smtp-sop.national.inria.fr: no sender authenticity information available from domain of postmaster@mail-lf0-f45.google.com) identity=helo; client-ip=209.85.215.45; receiver=mail3-smtp-sop.national.inria.fr; envelope-from="ivg@ieee.org"; x-sender="postmaster@mail-lf0-f45.google.com"; x-conformance=sidf_compatible IronPort-PHdr: =?us-ascii?q?9a23=3A95ZYZxY19j8vNKwNCN47qS3/LSx+4OfEezUN459i?= =?us-ascii?q?sYplN5qZr8qzbnLW6fgltlLVR4KTs6sC17KP9fi4EUU7or+5+EgYd5JNUxJXwe?= =?us-ascii?q?43pCcHRPC/NEvgMfTxZDY7FskRHHVs/nW8LFQHUJ2mPw6arXK99yMdFQviPgRp?= =?us-ascii?q?OOv1BpTSj8Oq3Oyu5pHfeQpFiCagbb9oMBm6sRjau9ULj4dlNqs/0AbCrGFSe+?= =?us-ascii?q?RRy2NoJFaTkAj568yt4pNt8Dletuw4+cJYXqr0Y6o3TbpDDDQ7KG81/9HktQPC?= =?us-ascii?q?TQSU+HQRVHgdnwdSDAjE6BH6WYrxsjf/u+Fg1iSWIdH6QLYpUjm58axlVAHnhz?= =?us-ascii?q?sGNz4h8WHYlMpwjL5AoBm8oxBz2pPYbJ2JOPZ7eK7Ses4URXdaXsZJSSNOHp+8?= =?us-ascii?q?YYUID+oEJ+lYro/9rEYKoRaxAQSgAeXiwSJKiHDrx603y+YuEQ/G0gIuHNwArW?= =?us-ascii?q?rao8nuOagITey41rPFwSnfY/5U3zr29YjGcgomofGJRb9+ctTRxlMpFwjYj1uQ?= =?us-ascii?q?rpDlPzSL1usRs2ib7vZgVfmygGMgqgFxvDevy9wtiobXmI0a1ErI9SJjwIY6PN?= =?us-ascii?q?C1TlNwb9CjEJtVrS6aNo12T9sjQ2FuoiY6y6cJtYS1fCgQ0JgnyB/fa+CHc4iV?= =?us-ascii?q?+R3vTvqeITB9hH59eLOwnRay8U+nyuHmSsa011NKojJEktbSqH8CyQbf6s+dSv?= =?us-ascii?q?ty+EqqxDWB1xjL5+1aPUw5kbDXJp0hz7IqiJYfrETOEjX5lUj2iqKda18q9fKy?= =?us-ascii?q?6+v9Z7Xrvp+cOJFwigH5Kqkun9awAeU8MgQXW2ib9/iw2KTt/UD2QLhGlPI2kq?= =?us-ascii?q?7esJDVIcQUuLS1DBNS0oYm8xq/DjGm38oEnXQfMl5JZBaKg5LqNlzOOvz0E+qz?= =?us-ascii?q?jlS2nDpkx/3KJrjhDY/MLnjHnrfhZ7F960tExQoy09Bf6IlZCrAfL/3tRED9rt?= =?us-ascii?q?vYDgU2MwCs2eboFM191p8CWWKIGqKWLLndsVqM5u42J+mMZZQVuCrmJvg+5//u?= =?us-ascii?q?iGc5lkUHcamo25sXcnG4Ee58L0WXe3q/yusGREkQtww1S+3xwHevaxN1SFuIF/?= =?us-ascii?q?Y26ys2Do2rF6/JR4e3jbPH3zamBZ1LI30AA1vKE2++JKueXPJZSTybJIdOlSAD?= =?us-ascii?q?S7OhSpM6nUWvqgDSyrdqI6zT4CJO5sGr78R8++CGzUJ6zjdzFcnIljzUFjAmri?= =?us-ascii?q?YzXzYzmZtHjwl4w1aH37J/hqUAR91e6v4PVR01Z8eFk75KTuvqUweERe+nDU68?= =?us-ascii?q?S4z+UzA8Q993xMUBMR4kRoeSyyvb1i/vOIc70ryGAJtur/DZ1nn1YsJzkzPIiP?= =?us-ascii?q?RngF4hTc9Cc2ahg/wn+g=3D=3D?= X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0BXAQDg8npahi3XVdFdDg4BAQEEAQEKA?= =?us-ascii?q?QGDeD9wKAqDW4E5iGuOJIICgmcqb415hVmBOQNcCiOFGAKCYAcZBwQwGAECAQE?= =?us-ascii?q?BAQEBAQEBEgEBAQgLCwgoL4I4JIJIAQMBASMdAQEsCwEECwsEBxodAgIiEgEFA?= =?us-ascii?q?QoSBhMSigsDCAUIEKUUQIspboIngwoBAQWEKAOBO4IKAQEBAQEBAQEBAQEBAQE?= =?us-ascii?q?BAQEBGAgShGOCFYFXhRaDJAsCAQGCHIJqgmWIeQyBcYhwkEgJiB6NXYIeZ4Eeh?= =?us-ascii?q?CKLeY16iXwUBSCBFw8QXoErfQg9MgaCDgmCEyofgVNdIzcBjhMBAQE?= X-IPAS-Result: =?us-ascii?q?A0BXAQDg8npahi3XVdFdDg4BAQEEAQEKAQGDeD9wKAqDW4E?= =?us-ascii?q?5iGuOJIICgmcqb415hVmBOQNcCiOFGAKCYAcZBwQwGAECAQEBAQEBAQEBEgEBA?= =?us-ascii?q?QgLCwgoL4I4JIJIAQMBASMdAQEsCwEECwsEBxodAgIiEgEFAQoSBhMSigsDCAU?= =?us-ascii?q?IEKUUQIspboIngwoBAQWEKAOBO4IKAQEBAQEBAQEBAQEBAQEBAQEBGAgShGOCF?= =?us-ascii?q?YFXhRaDJAsCAQGCHIJqgmWIeQyBcYhwkEgJiB6NXYIeZ4EehCKLeY16iXwUBSC?= =?us-ascii?q?BFw8QXoErfQg9MgaCDgmCEyofgVNdIzcBjhMBAQE?= X-IronPort-AV: E=Sophos;i="5.46,473,1511823600"; d="scan'208,217";a="253929154" Received: from mail-lf0-f45.google.com ([209.85.215.45]) by mail3-smtp-sop.national.inria.fr with ESMTP/TLS/AES128-GCM-SHA256; 07 Feb 2018 13:40:18 +0100 Received: by mail-lf0-f45.google.com with SMTP id t79so1141715lfe.3 for ; Wed, 07 Feb 2018 04:40:18 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=ieee-org.20150623.gappssmtp.com; s=20150623; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc; bh=94v2XhFVbB+M0jin+oqMr/0eGWZ6tANcWBWytfh4Bgw=; b=VAFTKFK9wt8YIHZfAzlojNRIdIgmSoRgRgN4QJhEHdCbimJmNn6emtWKP9fzDonUX2 OGrZ4wOwXPZqdnZYP2r0HFMtrkxGy9vRhGnTwrQksyz9h4QZOi+PhF2IMcWNGe8V1aE1 kPJbgN9jL4aoVGLUa/nPv40h34ebWYXzkyQa24G0qn23CIbjeWiKQbSbdhPc/xCfy/0m Z98HOl/z4OX0+aFh2gGzZMCwaHsFsGxZOgCW5PNp19XkZjnpQqO73brfYBBWi2rpGew9 Bj2GkOS0qnszx46OIpFOp7h+Sr+zoYQZKS3ukgoPJqibEB5GU7VuQRCvpi7gwoklpVmw RF+w== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:in-reply-to:references:from:date :message-id:subject:to:cc; bh=94v2XhFVbB+M0jin+oqMr/0eGWZ6tANcWBWytfh4Bgw=; b=MoTn3S9RcrK7T3r+jVjSQYu3pP4cN+ZFiEguRXS26BFn68cBt3GiclkZ7m36R65odA ctekxrzWrfXRIrswAR/7IKaWgPRU/iCQAL9SRxpqDNTW8uoCAAnzas9niz5/RpbsbpFM ZnPNNjcxFKP8FPaQ4rHY2+WqBnaneMOprxznQozce21kTfIh72xtpyLn2N0gE3wQW9hl tNdyancmPpJfIsLiUM+XwJpFn/e8pFBS3R0OaPZjyjUslWLXdGP210gzVyZRW4bC0SCp oS+1/7iGSaiAQG0wBnO2wcRZBW7hLY0f+bnySyKvJZ2wdArN4wIdmZLYr5SHeCSuhISp iDzg== X-Gm-Message-State: APf1xPCJed5thYzlx26laHSqpYXpbrOHfbfA+0KHmNa3Ng5IOt6YIo2x C2jWmtWfwq+TDGtJEVLBbaPIMMuED+xeFzB7JvKD8w== X-Google-Smtp-Source: AH8x227+i1Isx1AaZOfippKUUvbcgYOHUygk3NzVkrukkFZpCU/vlCPnNKCh+V+9BIEsdEZ4hFsfokYYBZvO/BQcqSc= X-Received: by 10.46.66.87 with SMTP id p84mr4170099lja.3.1518007217146; Wed, 07 Feb 2018 04:40:17 -0800 (PST) MIME-Version: 1.0 Received: by 10.46.68.200 with HTTP; Wed, 7 Feb 2018 04:40:15 -0800 (PST) Received: by 10.46.68.200 with HTTP; Wed, 7 Feb 2018 04:40:15 -0800 (PST) In-Reply-To: <51b207da-d84e-dec9-7953-7d776361d756@bioreg.kyushu-u.ac.jp> References: <20180123145453.GA1916@Magus.localnet> <20180123231432.GA20089@topoi.pooq.com> <51b207da-d84e-dec9-7953-7d776361d756@bioreg.kyushu-u.ac.jp> From: Ivan Gotovchits Date: Wed, 7 Feb 2018 07:40:15 -0500 Message-ID: To: Francois BERENGER Cc: caml-list Content-Type: multipart/alternative; boundary="94eb2c1c0a14f1e6ed05649e983d" Subject: Re: [Caml-list] [ANN] first release of bst: a bisector tree implementation --94eb2c1c0a14f1e6ed05649e983d Content-Type: text/plain; charset="UTF-8" Hi, Thanks for the excellent contribution, that's really useful. But can you please provide a license to use it? Something like MIT would be awesome! Cheers, Ivan Gotovchits On Feb 6, 2018 9:00 PM, "Francois BERENGER" wrote: > Hello, > > A bisector tree allows to do fast but exact nearest neighbor searches in > any space provided that you have a metric (function) to measure the > distance between any two points in that space. > > It also allows proximity queries, as in "all points within distance d > from my query point". > > Cf. this article for details: "A Data Structure and an Algorithm for the > Nearest Point Problem"; Iraj Kalaranti and Gerard McDonald. > ieeexplore.ieee.org/iel5/32/35936/01703102.pdf > > The code is here: > https://github.com/UnixJunkie/bisec-tree > > It might interest users of vantage point trees (minivpt, and vpt in > opam), kd-trees and such. > I think bst should be faster than vpt in most use cases. > > It should appear in opam shortly. > > Regards, > Francois. > > > -- > Caml-list mailing list. Subscription management and archives: > https://sympa.inria.fr/sympa/arc/caml-list > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > Bug reports: http://caml.inria.fr/bin/caml-bugs > --94eb2c1c0a14f1e6ed05649e983d Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Hi,

Thanks f= or the excellent contribution, that's really useful. But can you please= provide a license to use it? Something like MIT would be awesome!

Cheers,
I= van Gotovchits

On Feb 6, 2018 9:00 PM, "Francois BERENGER" <berenger@bioreg.kyushu-u.ac.jp> wrote:
Hello,=

A bisector tree allows to do fast but exact nearest neighbor searches in
any space provided that you have a metric (function) to measure the
distance between any two points in that space.

It also allows proximity queries, as in "all points within distance d<= br> from my query point".

Cf. this article for details: "A Data Structure and an Algorithm for t= he
Nearest Point Problem"; Iraj Kalaranti and Gerard McDonald.
ieeexplore.ieee.org/iel5/32/35936/01703102= .pdf

The code is here:
https://github.com/UnixJunkie/bisec-tree

It might interest users of vantage point trees (minivpt, and vpt in
opam), kd-trees and such.
I think bst should be faster than vpt in most use cases.

It should appear in opam shortly.

Regards,
Francois.


--
Caml-list mailing list.=C2=A0 Subscription management and archives:
https://sympa.inria.fr/sympa/arc/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
--94eb2c1c0a14f1e6ed05649e983d--