How to perform Range Search on 3D points set with CGAL?

Question

So I saw this nice 2D Range and Neighbor Search I alsow saw dD Range and Segment Trees yet I can not understand how to perform a 3D Range and Neighbor Search on a 3D point set. Generaly I want to query some points container for an array of points that are in distance R from some given point P. (Remark: why I do not want to do it manually - such search can be CPU/GPU/SSE optimized and I would like to use tested reliable efficient library in favour of my own)

score 2 · Answer 1 · answered Apr 19 '13 at 10:10

2

The example Example for Range Tree on Set-like Data is the example for the 2D-case. Turn the _2 into _3 in the typedefs and you have the 3D case.

answered Apr 19 '13 at 10:10

lrineau

6,036
3
34
47

How to perform Range Search on 3D points set with CGAL?

1 Answers1