c++ - How to perform Range Search on 3D points set with CGAL? -
so saw nice 2d range , neighbor search alsow saw dd range , segment trees yet can not understand how perform 3d range , neighbor search on 3d point set. generaly want query points container array of points in distance r
given point p
. (remark: why not want manually - such search can cpu/gpu/sse optimized , use tested reliable efficient library in favour of own)
the example example range tree on set-like data example 2d-case. turn _2 _3 in typedefs , have 3d case.
Comments
Post a Comment