PointSet and OrthTree #6475
Unanswered
petrasvestartas
asked this question in
Q&A
Replies: 3 comments 3 replies
-
I do not really understand what you want to achieve. Did you have a look at the Spatial Searching package? |
Beta Was this translation helpful? Give feedback.
2 replies
-
You want maybe do a range query that is retreiving all points at a distance less than r (which is a sphere of radius r). |
Beta Was this translation helpful? Give feedback.
1 reply
-
Have a look at this example in 2D that you have to adapt to 3D. |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hi,
Is there any example how you can apply 3d spatial tree for pointset distance search?
For example I contruct a pointset like this: https://doc.cgal.org/latest/Point_set_3/Point_set_3_2draw_point_set_3_8cpp-example.html
But for Orthtree I need to construct tree from scratch.
https://doc.cgal.org/latest/Orthtree/index.html
So should I use pointsets or I must construct trees instead? Are there any spatial searching algorithms in CGAL applicable to pointsets directly?
Beta Was this translation helpful? Give feedback.
All reactions