Home > Back-end >  O point cloud from point cloud point outside the closest point of three or more than three points
O point cloud from point cloud point outside the closest point of three or more than three points

Time:10-05

Objective: to find out three points or more, contains the coordinates of the three points

CodePudding user response:

Too vague question, don't know how to answer

Point cloud is a what thing, a pile of two-dimensional or three-dimensional discrete points?
What is the topology of the point cloud, namely how to differentiate between inside and outside?
How much amount of data, what is the scope

CodePudding user response:

Point cloud is the 3 d coordinates of a point cloud, there is no topology, scattered points, the nearest distance to all traversal, the number of points around 3000, the scope is the distance between a point to a pile of a minimum of three points,

CodePudding user response:

It depends on the calculation is a once in a while, still often want to use
Point cloud data is constantly changing, or basic unchanged

If one only occasionally, it doesn't matter, big deal each computing distance bai, calculation and keep distance from a minimum of three or more points, all calculate again have the results

If often want to use, you need to set up these points of the space structure of management mechanism, group or sort them
X first sort, for example, the same x and y, y to row z
A sorting, know to calculate point position, can in order to find its close, the range of less than
Also can put their grids, first positioning to compute the point at which a grid, and grid within and surrounding the grid point distance comparison of

CodePudding user response:

Often want to use the point cloud data is changeless, the individual feels this can call the existing in the photo library, previous must write good class, direct call, PCLS K_D of the tree to create topological relationship, contains a large amount of callable files and other third-party libraries, and write the idea is to have oneself a person, but to write code time complexity and space utilization is not good, know a little outside the point cloud three-dimensional coordinates, if we can find out from his recent three points or more, you can seek out points into a plane, then point to the distance, the distance is to point to point cloud, this is the way of thinking, your ideas, but become code implementation is completed, thank you

CodePudding user response:

Can respectively calculate that point to the Euclidean distance of each point in the array, bubble loop three times to find out a minimum of three, 3000 points only need to add and subtract, 15000 times by 9000 times, 3000 times square root, number 3 n - 6, should soon

CodePudding user response:

Is a method, like this, the feeling is very suffered, a point for so many times, that in the next point, why so many times, the time complexity is N second, to promote! Is best linear increase, has increased so scary,
  • Related