Subject: CGAL users discussion list
List archive
- From: "Chaman Singh Verma" <>
- To:
- Subject: [cgal-discuss] Nearest Neighbours and KDTree
- Date: Fri, 3 Oct 2008 23:55:54 +0530
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type; b=aGY8JbwT59u8gB56ET/n1RxrZaijZQN3vH8Awvmfp+sbSXmgCGdxWtKn2YZBCceq73 JnHdMaw0Ehbr0lUYASA4DBkk9DIT8Qvxdtihi+JTUb9A1MnVMpLD+ykvgpdk/106N+ih 5A+ZGCJbTVVe5lPK6Z5NguiNt8D/RJpnibT4Y=
Hello,
I am developing one application in which I need to find K-nearest neighbours. I am exploring both
CGAL and ANN library for this purpose.
The requirement is that the vertices are created and destroyed dynamically. Most of the time
the point cloud consists of of 10-20 millions, therefore building new KDTree for every vertex deletion
is not a good choice. Can someone give some information about updating KDTree ( insertion and deletion )
dynamically ? I think in ANN library it is not supported and I am not quite sure about CGAL.
Thanks,
Chaman Singh Verma
Poona, India
I am developing one application in which I need to find K-nearest neighbours. I am exploring both
CGAL and ANN library for this purpose.
The requirement is that the vertices are created and destroyed dynamically. Most of the time
the point cloud consists of of 10-20 millions, therefore building new KDTree for every vertex deletion
is not a good choice. Can someone give some information about updating KDTree ( insertion and deletion )
dynamically ? I think in ANN library it is not supported and I am not quite sure about CGAL.
Thanks,
Chaman Singh Verma
Poona, India
- [cgal-discuss] Nearest Neighbours and KDTree, Chaman Singh Verma, 10/03/2008
Archive powered by MHonArc 2.6.16.