Home/ Questions/Q 978173
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-16T04:01:07+00:00

What’s a good way to store point cloud data so that it’s optimal for

  • 0

What’s a good way to store point cloud data so that it’s optimal for an application that will do one of these two queries?

  1. Nearest (i.e. lowest euclidean distance) data point to (x,y,z)
  2. Get all the points inside a sphere with radius R around a point (x,y,z)

The structure will only be filled once, but read many times. A lowish memory footprint would be nice as I may be dealing with datasets of > 7 million points, but speed should be of primary concern. A library would be nice, but I wouldn’t mind implementing it myself if it’s something doable with limited expertise in the area.

Thanks in advance!

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    A Kd-Tree you get O(log(n)) nearest neighbor, and usually range queries will be fast.

    There are a bunch of libraries referenced there. I have not used any of them.

    You might also look at CGAL. I have used CGAL for other things, it is tolerably fast, extremely comprehensive, but the documentation will drive you to drink.

    • 0