Subject: CGAL users discussion list
List archive
- From: "Sebastien Loriot (GeometryFactory)" <>
- To:
- Subject: Re: [cgal-discuss] AABB Tree: closest_point
- Date: Tue, 19 Dec 2017 13:17:06 +0100
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:gLEVNRTZwrj6pwadANfATr72jdpsv+yvbD5Q0YIujvd0So/mwa6yZRGN2/xhgRfzUJnB7Loc0qyK6/mmATRIyK3CmUhKSIZLWR4BhJdetC0bK+nBN3fGKuX3ZTcxBsVIWQwt1Xi6NU9IBJS2PAWK8TW94jEIBxrwKxd+KPjrFY7OlcS30P2594HObwlSizexfa5+IA+qoQnNq8IbnZZsJqEtxxXTv3BGYf5WxWRmJVKSmxbz+MK994N9/ipTpvws6ddOXb31cKokQ7NYCi8mM30u683wqRbDVwqP6WACXWgQjxFFHhLK7BD+Xpf2ryv6qu9w0zSUMMHqUbw5Xymp4qF2QxHqlSgHLSY0/nzJhMx+jKxVoxyvqBJwzIHWfI6bO+Fzfr/fcN4AWWZNQshcWi5HD4ihb4UPFe0BPeNAooXzulUBswCxChO3BOPzyz9HmHn21rA83eQmCwHG3QsgH84Tu3jQrdv6KqASUeWrw6nU1zXCb/NY1i3h54jUdRAhu/GNUbd+fcHMzkQvDAfFjlKKqYzkODOVyv4Bs22f7+d7WuKvjnQoqwB1ojS12sgsjYzJi5sTx1vZ9it52J44KcOkREN/e9KpE5tduzuHO4doQc4uWXxktSc+x7Eeu5O2fzIGxIooyhPecfCLboyF7xz5WOuTITp1gm9udqiliBao60egz/XxVsmq31ZOqSpIitzMuWoM1xzX88SGROF98lu41TaBygze6+VJLVo7larcLJ4hzbowmYQJvUvfGS/2nV36jK6Qdko65uil8/rrbqniq5OGNIJ5ihvyPrkwlsG8G+g0LwkDUmyD9eS5zrLj/En5QLtQjv0xl6nUqIvaJcAcpq6jAg9V1Zoj5wy6Dzeiy9kYknwHI0hEeBKDlYTmJ1bOIPXgAfeln1usiCtrx+zBPrD5HprNIWLMkLP4cblg6k5c0xY8zc1E55JPEbwBO/LyWkrptNPCFBM5Mgq0w/zmCNpnzI8eV3iPUeelN/bZvlaMo+4uOOKRf5Q9uTDnKvFj6eS9o2U+nApXRqSj1IALaX2+VtBhOUSefTKsrdoGFGoWpBsQRef2j0eTEHQbM222WLg94S19DYaOAoLKR4Tri7uEinToVqZKb3xLXwjfWUzjcJ+JDq8B
I might have miss something but it seems to me that what you achieve is
what a kd-tree would be doing, right? Provided a kd-tree is internally
use by the AABB-tree to speed up distance queries it seems to me
that using a kd-tree directly would be better.
Did I miss something?
Sebastien.
On 12/19/2017 12:27 PM,
wrote:
Dear all,
first of all, thank you very much for the time you invest on CGAL, it is a very valuable library !
In our library, we have a quite extensive use of AABB Tree for efficient distance computation. Lately, I tried to use CGAL (maybe a little bit out of his scope...) to compute point to point distances with AABB Trees.
Indeed, only "point to 1D" and "point to 2D" queries are coded at the moment. I managed to "hack" CGAL/Cartesian/function_objects.h to make it work. Basically, it consists in adding operator()( const Point_3& s, const Point_3& p ) in class Construct_projected_point_3.
My questions are the following:
1/ Is it a bad idea ?
2/ if not, would you be interested in an upstream merge request ?
Best regards,
G.
- [cgal-discuss] AABB Tree: closest_point, , 12/19/2017
- <Possible follow-up(s)>
- [cgal-discuss] AABB Tree: closest_point, , 12/19/2017
- Re: [cgal-discuss] AABB Tree: closest_point, Sebastien Loriot (GeometryFactory), 12/19/2017
- Re: [cgal-discuss] AABB Tree: closest_point, , 12/19/2017
- Re: [cgal-discuss] AABB Tree: closest_point, Sebastien Loriot (GeometryFactory), 12/19/2017
Archive powered by MHonArc 2.6.18.