Assigning each point of a point cloud to a scanner position of a plurality of different scanner positions in a point cloud

1. A method, comprising:

receiving a point cloud that includes a plurality of points each having a position relative to the at least one scanner, wherein the point cloud is captured by a plurality of scanners;

creating a disk for each point of the point cloud, where the disk includes a size based on a computed scale for the point and an orientation based on a computed non-oriented normal for the point;

inserting each disk into a search structure;

creating a plurality of segments for a given point of the point cloud, wherein each of the plurality of segments represents a different path from the given point to each of the plurality of scanners;

querying the search structure utilizing the plurality of segments to determine if one or more disks intersect each path from the given point to each of the plurality of scanners;

creating a plurality of outputs based on the query, wherein each output corresponds to a different scanner of the plurality of scanners, and where each output includes a number of intersecting disks intersecting the path from the given point to the different scanner and further includes a distance from the given point to the different scanner;

implementing a sorting algorithm that compares values of the plurality of outputs to identify a selected scanner of the plurality of scanners, where the selected scanner corresponds to a particular output of the plurality of outputs; and

assigning the given point to a scanner position of the selected scanner.

2. The method of claim 1 , wherein the computed scale for the point is computed by dividing the distance from the point to a neighboring point by 2.

3. The method of claim 2 , wherein the neighboring point is a 25 th nearest neighboring point of the point.

4. The method of claim 1 , wherein the computed non-oriented normal for the point is computed utilizing a principal component analysis (PCA) algorithm.

5. The method of claim 1 , wherein the search structure is an Axis Aligned Bounding Box tree (AABB tree).

6. The method of claim 1 , further comprising adjusting the number of intersecting disks for a selected output based on a determination that a particular disk is associated with noise.

7. The method of claim 1 , wherein a selected disk, for a selected point of the point cloud, has a center that lies at the x, y, and z coordinate of the selected point, and the selected disk has a radius that corresponds to the computed scale for the selected point.

8. The method of claim 7 , wherein the selected disk has an orientation in space that corresponds the computed non-oriented normal.

9. The method of claim 1 , wherein the sorting algorithm compares the values of pairs of the plurality of outputs, the sorting algorithm utilizes:

if p is visible and q is not, then p is better than q;

if q is visible and q is not, then q is a better than p;

if Np<Nq−1 or if (Np<=Nq+1 and p segment is shorter than q segment), then p is better than q;

Else q is better than p,

where p is a first selected output of the plurality of outputs, q is a second selected output of the plurality of outputs, Np is the number of intersecting disks included in the first selected output, Nq is the number of intersecting disks included in the second selected output, p segment is the distance from the given point to a first scanner associated with the first selected output, and q segment is the distance from the given point to a second scanner associated with the second selected output.

10. A system for assigning a point of a point cloud to a scanner position of a plurality of scanner positions in the point cloud, the system comprising:

processing logic configured to:

receive the point cloud that includes a plurality of points each having a position relative to at least one scanner, wherein the point cloud is captured by a plurality of scanners;

create a disk for each point of the point cloud, where the disk includes a size based on a computed scale for the point and an orientation based on a computed non-oriented normal for the point;

insert each disk into a search structure;

create a plurality of segments for a given point of the point cloud, wherein each of the plurality of segments represents a different path from the given point to each of the plurality of scanners;

query the search structure utilizing the plurality of segments to determine if one or more disks intersect each path from the given point to each of the plurality of scanners;

create a plurality of outputs based on the query, wherein each output corresponds to a different scanner of the plurality of scanners, and where each output includes a number of intersecting disks intersecting the path from the given point to the different scanner and further includes a distance from the given point to the different scanner;

implement a sorting algorithm that compares values of the plurality of outputs to identify a selected scanner of the plurality of scanners, where the selected scanner corresponds to a particular output of the plurality of outputs; and

assign the given point to a scanner position of the selected scanner.

11. The system of claim 10 , wherein the computed scale for the point is computed by dividing the distance from the point to a neighboring point by 2.

12. The system of claim 11 , wherein the neighboring point is a 25 th nearest neighboring point of the point.

13. The system of claim 10 , wherein the computed non-oriented normal for the point is computed utilizing a principal component analysis (PCA) algorithm.

14. The system of claim 10 , wherein the search structure is an Axis Aligned Bounding Box tree (AABB tree).

15. The System of claim 10 , wherein the processing logic is further configured to adjust the number of intersecting disks for a particular output based on a determination that a particular disk is associated with noise.

16. The system of claim 10 , wherein a selected disk, for a selected point of the point cloud, has a center that lies at the x, y, and z coordinate of the selected point, and the selected disk has a radius that corresponds to the computed scale for the selected point.

17. The system of claim 16 , wherein the selected disk has an orientation in space that corresponds the computed non-oriented normal.

18. The system of claim 10 , wherein the sorting algorithm compares the values of pairs of the plurality of outputs, and the processing logic is further configured to utilize a plurality of conditions that include:

if p is visible and q is not, then p is better than q;

if q is visible and q is not, then q is a better than p;

if Np<Nq−1 or if (Np<=Nq+1 and p segment is shorter than q segment), then p is better than q;

Else q is better than p,

where p is a first selected output of the plurality of outputs, q is a second selected output of the plurality of outputs, Np is the number of intersecting disks included in the first selected output, Nq is the number of intersecting disks included in the second selected output, p segment is the distance from the given point to a first scanner associated with the first selected output, and q segment is the distance from the given point to a second scanner associated with the second selected output.

19. A non-transitory electronic-device readable medium having instructions stored thereon, the instructions when executed by one or more electronic devices operable to:

receive a point cloud that includes a plurality of points each having a position relative to at least one scanner, wherein the point cloud is captured by a plurality of scanners;

create a disk for each point of the point cloud, where the disk includes a size based on a computed scale for the point and an orientation based on a computed non-oriented normal for the point;

insert each disk into a search structure;

create a plurality of segments for a given point of the point cloud, wherein each of the plurality of segments represents a different path from the given point to each of the plurality of scanners;

query the search structure utilizing the plurality of segments to determine if one or more disks intersect each path from the given point to each of the plurality of scanners;

create a plurality of outputs based on the query, wherein each output corresponds to a different scanner of the plurality of scanners, and where each output includes a number of intersecting disks intersecting the path from the given point to the different scanner and further includes a distance from the given point to the different scanner;

implement a sorting algorithm that compares values of the plurality of outputs to identify a selected scanner of the plurality of scanners, where the selected scanner corresponds to a particular output of the plurality of outputs; and

assign the given point to a scanner position of the selected scanner.

20. The non-transitory electronic-device readable medium of claim 19 , wherein the computed scale for the point is computed by dividing the distance from the point to a neighboring point by 2.