Publication number | US7933749 B2 |

Publication type | Grant |

Application number | US 12/056,238 |

Publication date | Apr 26, 2011 |

Filing date | Mar 26, 2008 |

Priority date | Aug 29, 2007 |

Fee status | Paid |

Also published as | CN101377851A, US20090063105 |

Publication number | 056238, 12056238, US 7933749 B2, US 7933749B2, US-B2-7933749, US7933749 B2, US7933749B2 |

Inventors | Chih-Kuang Chang, Xin-Yuan Wu, Hua Huang |

Original Assignee | Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd., Hon Hai Precision Industry Co., Ltd. |

Export Citation | BiBTeX, EndNote, RefMan |

Patent Citations (21), Referenced by (4), Classifications (12), Legal Events (2) | |

External Links: USPTO, USPTO Assignment, Espacenet | |

US 7933749 B2

Abstract

A method for computing minimum distances between two point clouds is provided. The method includes: (a) acquiring a first point cloud and a second point cloud; (b) establishing a topological structure for the second point cloud to make points of the second point cloud confined in a plurality of related cubical grids; (c) selecting a point from the first point cloud; (d) searching one or more cubical grids from the related cubical grids according to the topological structure and computing a distance between the selected point and each of points which belong to the second point cloud and in the searched cubical grids to obtain a closest point from the second point cloud, which has a shortest distance to the selected point; (e) repeating steps from (c) to (d) until all the points in the first point cloud have been selected. A related system is also provided.

Claims(6)

1. A computer-enabled method for computing minimum distances between two point clouds, the method being performed by execution of computer readable program code by at least one processor of at least one computer system, the method comprising steps of:

(a) acquiring a first point cloud and a second point cloud using the at least one processor;

(b) establishing a topological structure for the second point cloud to make points of the second point cloud confined in a plurality of related cubical grids using the at least one processor, comprising:

(b1) identifying an outermost point on each surface edge of the second point cloud by analyzing coordinates values of the points in the second point cloud;

(b2) creating a cubical figure that can confine the second point cloud according to the outmost points;

(b3) deriving a length, a width and a height of the cubical figure;

(b4) dividing the cubical figure into the plurality of cubical grids according to the length, the width, and the height of the cubical figure and an axes interval step preconfigured by a user; and

(b5) configuring serial numbers for the cubical grids to identify the cubical grids;

(c) selecting a point, which has not been selected, from the first point cloud using the at least one processor;

(d) searching one or more cubical grids from the related cubical grids according to the topological structure, and computing a distance between the selected point and each of points which belong to the second point cloud and in the searched cubical grids to obtain a closest point from the second point cloud, which has a shortest distance to the selected point, wherein the shortest distance is one of the minimum distances between the two point cloud using the at least one processor;

(e) repeating steps from (c) to (d) until all the points in the first point cloud have been selected.

2. The method described in claim 1 , wherein the step (d) comprises:

(d1) computing a distance D from the selected point perpendicular to a plane of a closest side-surface of the cubical figure;

(d2) creating a measuring cube having a center of the selected point, and with a length of 2*(D+n*step), wherein n=n++, making the measuring cube cross with the cubical figure to form an intersection area, wherein cubical grids of the intersection area is the searched cubical grids;

(d3) computing distances between the selected point and points which belong to the second point cloud and in the searched cubical grids, to obtain a closest point which has a shortest distance d to the selected point ;

(d4) judging that whether d>(D+n*step) or not;

(d5) ascertaining that the distance d is the minimum distance if d<(D+n*Step); and

(d6) executing step (d2) to step (d5) if d>(D+n*step).

3. A computerized method for computing minimum distances between a point cloud and a curved surface, the method being performed by execution of computer readable program code by at least one processor of at least one computer system, the method comprising:

(a) acquiring a first point cloud and a curved surface using the at least one processor;

(b) constructing a mesh of triangular facets based on the curved surface using the at least one processor;

(c) gathering vertexes of triangles of the mesh of triangular facets to form a second point cloud using the at least one processor;

(d) establishing a topological structure for the second point cloud to make points of the second point cloud confined in a plurality of related cubical grids using the at least one processor, comprising:

(d1) identifying an outermost point on each surface edge of the second point cloud by analyzing coordinates values of the points in the second point cloud;

(d2) creating a cubical figure that can confine the second point cloud according to the outmost points;

(d3) deriving a length, a width and a height of the cubical figure;

(d4) dividing the cubical figure into the plurality of cubical grids according to the length, the width, and the height of the cubical figure and an axes interval step preconfigured by a user; and

(d5) configuring serial numbers for the cubical grids to identify the cubical grids;

(e) selecting a point, which has not been selected, from the first point cloud using the at least one processor;

(f) searching one or more cubical grids from the related cubical grids according to the topological structure, and computing a distance between the selected point and each of points which belong to the second point cloud and in the searched cubical grids to obtain a closest point p from the second point cloud, which has a shortest distance to the selected point using the at least one processor;

(g) computing distances between the selected point and triangles whose vertex is the point p to obtain a shortest distance, wherein the shortest distance is one of the minimum distances between the point cloud and the curved surface using the at least one processor; and

repeating step (e) to step (g) until all the points in the first point cloud have been selected using the at least one processor.

4. The method as described in claim 3 , wherein the step (f) comprises:

(f1) computing a distance D from the selected point perpendicular to a plane of a closest side-surface of the cubical figure;

(f2) creating a measuring cube having a center of the selected point, and with a length of 2*(D+n*step), wherein n=n++, making the measuring cube cross with the cubical figure to form an intersection area, wherein cubical grids of the intersection is the searched cubical grids;

(f3) computing distances between the selected point and points which belong to the second point cloud and in the searched cubical grids, to obtain the closest pointer p which has a shortest distance d to the selected point;

(f4) judging that whether d>(D+n*step) or not;

(f5) ascertaining that the distance d is the minimum distance if d<(D+n*Step); and

(f6) executing step (d2) to step (d5) if d>(D+n*step).

5. A computerized method for computing a minimum distance between two curved surfaces, the method being performed by execution of computer readable program code by at least one processor of at least one computer system, the method comprising:

(a) acquiring two curved surfaces using the at least one processor;

(b) constructing two meshes of triangular facets based on the two curved surfaces respectively using the at least one processor;

(c) gathering center points of triangles in one mesh of triangular facets to form a first point cloud, and gathering vertexes of triangles in other mesh of triangular facets to form a second point cloud using the at least one processor;

(d) establishing a topological structure for the second point cloud to make points of the second point cloud confined in a plurality of related cubical grids using the at least one processor, comprising:

(d1) identifying an outermost point on each surface edge of the second point cloud by analyzing coordinates values of the points in the second point cloud;

(d2) creating a cubical figure that can confine the second point cloud according to the outmost points;

(d3) deriving a length, a width and a height of the cubical figure;

(d4) dividing the cubical figure into the plurality of cubical grids according to the length, the width, and the height of the cubical figure and an axes interval step preconfigured by a user; and

(d5) configuring serial numbers for the cubical grids to identify the cubical grids;

(e) selecting a point p**0**, which has not been selected, from the first point cloud using the at least one processor;

(f) searching one or more cubical grids from the related cubical grids according to the topological structure, and obtaining a point p from the second point cloud, which has the shortest distance to the point p**0** by computing a distance between the point “p**0**” and each of points which belong to the second point cloud and in the searched cubical grids using the at least one processor;

(g) computing distances between the point p**0** and triangles whose vertex is point p to obtain a triangle “a” which has a shortest distance to the point p**0** using the at least one processor;

(h) computing a distances dn between the triangle a and the triangle whose center point is p**0** using the at least one processor;

repeating steps from (e) to (i) for computing a plurality of distances dn until all the points in the first point cloud have been selected using the at least one processor; and

(j) computing an average distance of the distances dn, wherein the average distance is the minimum distance between the two curved surfaces using the at least one processor.

6. The method as described in claim 5 , wherein the step (f) comprises:

(f1) computing a distance D from the selected point perpendicular to a plane of a closest side-surface of the cubical figure;

(f2) creating a measuring cube having a center of the selected point, and with a length of 2*(D+n*step), wherein n=n++, making the measuring cube cross with the cubical figure to form an intersection area, wherein cubical grids of the intersection area is the searched cubical grids;

(f3) computing distances between the selected point and points which belong to the second point cloud and in the searched cubical grids, to obtain the closest point p which has a shortest distance d to the selected point;

(f4) judging that whether d>(D+n*step) or not;

(f5) ascertaining that the distance d is the minimum distance if d<(D+n*Step); and

(f6) executing step (d2) to step (d5) if d>(D+n*step).

Description

1. Field of the Invention

The present invention relates to systems and methods for computing distances, particularly to a system and a method for computing minimum distances between two point clouds.

2. Description of Related Art

In recent years, with continuous improvement of computer hardware and software, computers play a major role in a point cloud processing system. The point cloud processing system generally includes: a point cloud obtaining device for obtaining point cloud of an object and inputting the point cloud to a computer; a computer for executing software to process the point cloud, such as Computer Aided Verification (CAV), Reverse Engineering (RE), and so on.

During processing the point cloud, different distances usually need to be computed, for example, minimum distances between two point clouds. The minimum distances between two point clouds mean a gather of a distance between each point of a first point cloud and a nearest point (which is nearest to the point of the first point cloud) of a second point cloud. In order to compute the minimum distances between two point clouds, a conventional method is used. The conventional method can be described as: computing distances between each point in the first point cloud and each point in the second point cloud for getting the shortest distances. Usually, a quantity of the points in the point cloud may be hundreds of thousands, several million, even several billion. Thus, such conventional method of computing the minimum distances between two point clouds is becoming a severe inefficiency problem resulting in difficult, complex and time-consuming.

What is needed, therefore, is a method for computing the distances between two point clouds, which is capable of computing the minimum distances between two point clouds quickly and conveniently.

A computer-enabled method for computing minimum distances between two point clouds is provided. The method includes steps of: (a) acquiring a first point cloud and a second point cloud; (b) establishing a topological structure for the second point cloud to make points of the second point cloud confined in a plurality of related cubical grids; (c) selecting a point, which has not been selected, from the first point cloud; (d) searching one or more cubical grids from the related cubical grids according to the topological structure, and computing a distance between the selected point and each of points which belong to the second point cloud and in the searched cubical grids to obtain a closest point from the second point cloud, which has a shortest distance to the selected point, wherein the shortest distance is one of the minimum distances between the two point cloud; (e) repeating steps from (c) to (d) until all the points in the first point cloud have been selected.

Other advantages and novel features of the present invention will become more apparent from the following detailed description of preferred embodiment when taken in conjunction with the accompanying drawings, in which:

**11** in

**13** in

**1** (only one shown), an application server **2**, a keyboard **3**, and a mouse **4**. The application server **2** is connected with a database **5**.

The database **5** is mainly configured for storing a plurality of point clouds which are obtained by a point cloud obtaining device (not shown in

The application server **2** is mainly configured for acquiring the point clouds from the database **5**. The application server **2** is installed with a plurality of software function modules that are mainly used for processing the point clouds to compute minimum distances between two point clouds. The at least one client computer **1** may be located at various locations (e.g., different internal departments) of an organization. Each client computer **1** provides a graphical user interface (GUI) for displaying the point clouds.

The keyboard **3** and the mouse **4** connect to the application server **2**, and mainly configured for inputting data while processing the point clouds.

**2** in **2** typically includes: an acquiring module **20**, a topological structure establishing module **21**, a selecting module **22**, a minimum distance computing module **23**, a storing module **24**, and a judging module **25**.

The acquiring module **20** is mainly configured for acquiring the point clouds from the database **5**. In the preferred embodiment, the acquiring module **20** acquires two point clouds from the database **5**, namely a first point cloud and a second point cloud.

The topological structure establishing module **21** is mainly configured for establishing a topological structure for the second point cloud, namely constructing a relationship between the points of the second point cloud. Specifically, the topological structure establishing module **21** first identifies an outermost point on each surface edge of the second point cloud by analyzing coordinates values of the points in the second point cloud, and creates a cubical figure that can confine the second point cloud according to the outmost points. Then, the topological structure establishing module **21** derives a length, a width and a height of the cubical figure. Finally, the topological structure establishing module **21** divides the cubical figure into a plurality of cubical grids according to the length, the width, the height of the cubical figure and an axes interval “step” that is preconfigured by a user. Thus, the points in the second point cloud may be separately confined in different related cubical grids. According to the axes interval “step” preconfigured by the user and the density of the second point cloud, each cubical grid may confine one or more points. The topological structure establishing module **21** is further configured for configuring serial numbers for all the cubical grids to identify the cubical grids, for example, “001”, “002”, . . . , “xxx”.

The selecting module **22** is mainly configured for selecting a point which has not been selected by the selecting module **22** (hereinafter, referred to as “selected point”) from the first point cloud.

The minimum distance computing module **23** is mainly configured for computing distances between the selected point and the points in the second point cloud for obtaining a closest point from the second point cloud, which has a shortest distance to the selected point, according to the topological structure of the second point cloud. The shortest distance is one of the minimum distances between the two point clouds. Specifically, the minimum distance computing module **23** searches one or more cubical grids according to the topological structure of the second point cloud, and obtains the closest point by computing a distance between the selected point and each of points which belong to the second point cloud and in the searched cubical grids. The one or more cubical grids are searched by way of: computing a distance “D” from the selected point perpendicular to a plane of a closest side-surface of the cubical figure; and creating a measuring cube having a center of the selected point, and with a length of 2*(D+n*step), wherein n=n++, making the measuring cube cross with the cubical figure to form an intersection area, wherein the cubical grids of the intersection is the searched cubical grids;

The storing module **24** is mainly configured for storing the minimum distance and the closest point into the database **5**.

The judging module **25** is mainly configured for determining whether all the points in the first point cloud have been selected by the selecting module **22**. If at least one point in the first point cloud has not been selected, the selecting module **22** selects another point, which has not been selected, from the first point cloud.

In step S**10**, the acquiring module **20** acquires a first point cloud and a second point cloud from the database **5**.

In step S**11**, the topological structure establishing module **21** establishes a topological structure for the second point cloud, namely constructing a relationship between the points of the second point cloud. Detailed steps of establishing the topological structure for the second point cloud are depicted in

In step S**12**, the selecting module **22** selects a point, which has not been selected, from the first point cloud.

In step S**13**, the minimum distance computing module **23** computes distances between the selected point and the points in the second point cloud according to the topological structure of the second point cloud, for obtaining a closest point from the second point cloud which has a shortest distance to the selected point. The shortest distance is one of the minimum distances between the two point clouds. Detailed steps of computing the distance are depicted in

In step S**14**, the storing module **24** stores the minimum distance and the closest point into the database **5**.

In step S**15**, the judging module **25** judges whether all the points in the first point cloud have been selected by the selecting module **22**. If at least one point in the first point cloud has not been selected, the procedure returns to the step S**12**, the selecting module **22** selects another point, which has not been selected, from the first point cloud. Otherwise, if all points in the first point cloud have been selected, the procedure ends.

**11** in

In step S**110**, the topological structure establishing module **21** identifies an outermost point on each surface edge of the second point cloud by analyzing coordinates values of the points in the second point cloud. It is known that a point cloud has six surfaces in three-dimensional space, thus, the topological structure establishing module **21** can identify six outmost points.

In step S**111**, the topological structure establishing module **21** creates a cubical figure that can confine the second point cloud according to the outmost points. Specifically, the topological structure establishing module **21** first obtains a group of coordinate values (Pt_{Min[x]}, Pt_{Min[y]}, Pt_{Min[z]}) of the outmost point whose x-coordinate value, y-coordinate value and z-coordinate value are all minimum, and further obtains another group of coordinate values (Pt_{Max[x]}, Pt_{Max[y]}, Pt_{Max[z]}) of another outmost point whose x-coordinate value, y-coordinate value and z-coordinate value are all maximum. Then, the topological structure establishing module **21** obtains eight groups of coordinate values (Pt_{Min[x]}, Pt_{Min[y]}, Pt_{Min[z]}), (Pt_{Min[x]}, Pt_{Min[y]}, Pt_{Max[z]}), (Pt_{Min[x]}, Pt_{Max[y]}, Pt_{Min[z]}), (Pt_{Min[x]}, Pt_{Max[y]}, Pt_{Max[z]}), (Pt_{Max[x]}, Pt_{Max[y]}, Pt_{Max[z]}), (Pt_{Max[x]}, Pt_{Max[y]}, Pt_{Min[z]}), (Pt_{Max[x]}, Pt_{Min[y]}, Pt_{Max[z]}) and (Pt_{Max[x]}, Pt_{Min[y]}, PtMin_{[z]}) according to the coordinate values (Pt_{Min[x]}, Pt_{Min[y]}, Pt_{Min[z]}) and the coordinate values (Pt_{Max[x]}, Pt_{Max[y]}, Pt_{Max[z]}). Finally, the topological structure establishing module **21** creates a cubical figure with the vertexes of the eight groups of coordinate values.

In step S**112**, the topological structure establishing module **21** derives a length, a width, and a height of the cubical figure according to the eight groups of coordinate values.

In step S**113**, the topological structure establishing module **21** divides the cubical figure into a plurality of cubical grids according to the length, the width, and the height of the cubical figure and the axes interval “step” preconfigured by the user. Thus, the points in the second point cloud may be separately confined in different cubical grids.

In step S**114**, the topological structure establishing module **21** configures serial numbers for all the cubical grids to identify the cubical grids, for example, “001”, “002”, . . . , “xxx”.

**13** in

In step S**130**, the minimum distance computing module **23** computes a distance “D” from the selected point perpendicular to a plane of a closest side-surface of the cubical figure.

In step S**131**, the minimum distance computing module **23** creates a measuring cube having a center of the selected point and with a length of 2*(D+n*step), wherein n=n++, and the character “*” is a multiplication sign. Thus, the measuring cube crosses with the cubical figure forming an intersection area. The “n” appears in the length of the measuring cube is a number of how much times the measuring cube is created, herein n=1; and the “step” is the axes interval preconfigured by the user.

In step S**132**, the minimum distance computing module **23** obtains the serial numbers of the cubical grid in the intersection area, and computes a quantity of the cubical grids of the intersection area.

In step S**133**, the judging module **25** judges whether at least one point which belongs to the second point cloud exists in the cubical grids of the intersection area. If no such point exists in the cubical grids of the intersection area, the procedure returns to step S**131**, the minimum distance computing module **23** expands the measuring cube by creating a new measuring cube with an enlarge length of 2*(D+n*step) and still having a center of the selected point.

If at least one point which belongs to the second point cloud exists in the cubical grids of the intersection area, in step S**134**, the minimum computing module **23** computes distances between the selected point and the points which belong to the second point cloud and in the cubical grids of the intersection area for obtaining a closest point which has a shortest distance “d” to the selected point.

In step S**135**, the judging module **25** compares and judges whether d>(D+n*step) or not. If d≦(D+n*Step), in step S**136**, the minimum distance computing module **23** ascertains that the distance “d” is the minimum distance between the selected point and the second point cloud. In step S**137**, the storing module **24** stores the minimum distance “d” and the closest point into the database **5**.

Otherwise, if d>(D+n*step), the procedure returns to step S**131** described above, for expanding the measuring cube to form a bigger intersection area, until the minimum distance computing module **23** computes a shortest distance “d”, which is less than or equal to the distance of (D+n*step).

Using the idea of computing minimum distance as described from

In step S**20**, the acquiring module **20** acquires a first point cloud and a curved surface.

In step S**21**, the topological structure establishing module **21** constructs a mesh of triangular facets based on the curved surface. It is well known that the curved surface is composed of a plurality of triangles in microscopic view, thus, the topological structure establishing module **21** can construct the mesh of triangular facets by dividing the curved surface into the triangles.

In step S**22**, the topological structure establishing module **21** gathers vertexes of the triangles in the mesh of triangular facets to form a second point cloud.

In step S**23**, the topological structure establishing module **21** establishes a topological structure for the second point cloud. Specifically, the topological structure establishing module **21** creates a cubical figure that can confine the second point cloud, and divides the cubical figure into a plurality of cubical grids. The method of establishing the topological structure has been depicted in the

In step S**24**, the selecting module **22** selects a point, which has not been selected, from the first point cloud.

In step S**25**, the minimum distance computing module **23** computes distances between the selected point and points in the second point cloud according to the topological structure for obtaining a closest point “p” from the second point cloud, which has a shortest distance to the selected point. The method of computing the distance has been depicted in

In step S**26**, the minimum distance computing module **23** computes distances between the selected point and the triangles whose vertex is point “p” for obtaining a shortest distance. The shortest distance is one of the minimum distances between the point cloud and the curved surface.

In step S**27**, the storing module **24** stores the minimum distance. In step S**28**, the judging module **25** judges that whether all points in the first point cloud have been selected. If no, the procedure returns to step S**23** depicted above. Otherwise, if all points in the first point cloud have been selected, the procedure ends.

In step S**30**, the acquiring module **21** acquires two curved surfaces.

In step S**31**, the topological structure establishing module **21** constructs two mesh of triangular facets based on the two curved surfaces respectively.

In step S**32**, the topological structure establishing module **21** gathers center points of the triangles in one mesh of triangular facets to form a first point cloud, and gathers vertexes of the triangles in the other mesh of triangular facets to form a second point cloud.

In step S**33**, the topological structure establishing module **21** establishes a topological structure for the second point cloud. Specifically, the topological structure establishing module **21** creates a cubical figure that can confine the second point cloud, and divides the cubical figure into a plurality of cubical grids. The method of establishing a topological structure has been depicted in

In step S**34**, the selecting module **22** selects a point “p_{0}”, which has not been selected, from the first point cloud.

In step S**35**, the minimum distance computing module **23** computes distances between the selected point “p_{0}” and the points in the second point cloud according to the topological structure, for obtaining a closest point “p” from the second point cloud, which has the shortest distance to the selected point. The method of computing the distances between the selected point “p_{0}” and the points in the second point cloud according to the topological structure has been depicted in

In step S**36**, the minimum distance computing module **23** computes distances between the selected point “p_{0}” and the triangles whose vertex is point “p”, for obtaining a triangle “a” which has a shortest distance to the selected point “p_{0}”.

In step S**37**, the minimum distance computing module **23** computes a distance “d_{n}” between the triangle “a” and the triangle whose center point is “p_{0}”.

In step S**38**, the storing module **24** stores the distance “d_{n}”. In step S**39**, the judging module **25** judges whether all the points in the first point cloud have been selected. If no, the procedure returns to step S**23** as described above for computing a plurality of distances “d_{n}”. Otherwise, if all the points in the first point cloud have been selected, in step S**40**, the minimum distance computing module **23** computes an average distance of the distances “d_{n}”. The average distance is the minimum distance between the two curved surfaces.

It should be emphasized that the above-described embodiments of the present invention are merely possible examples of implementations, merely set forth for a clear understanding of the principles of the invention. Many variations and modifications may be made to the above-described embodiment(s) of the invention without departing substantially from the spirit and principles of the invention. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present invention and protected by the following claims.

Patent Citations

Cited Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US5903458 * | Jun 6, 1997 | May 11, 1999 | Ford Global Technologies, Inc. | System and method for forming geometric features using global reparametrization |

US6285372 * | May 8, 1998 | Sep 4, 2001 | Lawrence C. Cowsar | Multiresolution adaptive parameterization of surfaces |

US6516099 * | Aug 5, 1998 | Feb 4, 2003 | Canon Kabushiki Kaisha | Image processing apparatus |

US6920242 * | Feb 18, 2004 | Jul 19, 2005 | Ronald W. Moore | Apparatus and method for point cloud assembly |

US6974373 * | Aug 2, 2002 | Dec 13, 2005 | Geissler Technologies, Llc | Apparatus and methods for the volumetric and dimensional measurement of livestock |

US6996505 * | Jun 29, 2000 | Feb 7, 2006 | Raindrop Geomagic, Inc. | Methods, apparatus and computer program products for automatically generating nurbs models of triangulated surfaces using homeomorphisms |

US7047151 * | May 28, 2004 | May 16, 2006 | Hon Hai Precision Ind. Co., Ltd | System and method for detecting defects of objects based on a CAD platform |

US7065461 * | Sep 27, 2004 | Jun 20, 2006 | Hon Hai Precision Industry Co., Ltd | Point cloud measuring system and method |

US7602963 * | Jan 10, 2006 | Oct 13, 2009 | General Electric Company | Method and apparatus for finding anomalies in finished parts and/or assemblies |

US7683900 * | Dec 29, 2004 | Mar 23, 2010 | Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. | System and method for processing a point cloud in a simulated three-dimensional space |

US20030067461 * | May 21, 2002 | Apr 10, 2003 | Fletcher G. Yates | Methods, apparatus and computer program products that reconstruct surfaces from data point sets |

US20030137646 * | Jan 23, 2002 | Jul 24, 2003 | Quantapoint, Inc. | Method and apparatus for generating structural data from laser reflectance images |

US20040001620 * | Jun 26, 2002 | Jan 1, 2004 | Moore Ronald W. | Apparatus and method for point cloud assembly |

US20040027347 * | Jun 12, 2003 | Feb 12, 2004 | Ali Farsaie | Discrete linear space sampling method and apparatus for generating digital 3D models |

US20050146522 * | Dec 31, 2003 | Jul 7, 2005 | Silicon Graphics Inc. | Accelerated ray-object intersection |

US20050246130 * | Apr 29, 2005 | Nov 3, 2005 | Landmark Graphics Corporation, A Halliburton Company | System and method for approximating an editable surface |

US20060098008 * | Jun 3, 2003 | May 11, 2006 | Christof Holberg | Method, device and computer program product for generating a three-dimensional model |

US20060116838 * | Jun 13, 2005 | Jun 1, 2006 | Hon Hai Precision Industry Co., Ltd. | Method and system for cutting point cloud automatically |

US20070124107 * | Jan 30, 2007 | May 31, 2007 | Shouhei Numata | Shape model generation method and shape model generation system |

US20070265727 * | Mar 7, 2007 | Nov 15, 2007 | Seockhoon Bae | System and method for mesh and body hybrid modeling using 3d scan data |

US20070285425 * | Nov 10, 2006 | Dec 13, 2007 | Inus Technology, Inc. | Reverse modeling method using mesh data as feature |

Referenced by

Citing Patent | Filing date | Publication date | Applicant | Title |
---|---|---|---|---|

US8805015 * | Oct 9, 2012 | Aug 12, 2014 | Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. | Electronic device and method for measuring point cloud of object |

US9390124 * | Mar 15, 2013 | Jul 12, 2016 | Microsoft Technology Licensing, Llc. | Version control system using commit manifest database tables |

US20130251195 * | Oct 9, 2012 | Sep 26, 2013 | Chih-Kuang Chang | Electronic device and method for measuring point cloud of object |

US20140279903 * | Mar 15, 2013 | Sep 18, 2014 | Microsoft Corporation | Version control system using commit manifest database tables |

Classifications

U.S. Classification | 703/2, 382/154 |

International Classification | G06F7/60, G06F17/10 |

Cooperative Classification | G06K9/6211, G06T7/001, G06T2207/30108, G06T2207/10028, G06T7/30 |

European Classification | G06T7/00D1, G06T7/00B1R, G06K9/62A1A3 |

Legal Events

Date | Code | Event | Description |
---|---|---|---|

Mar 26, 2008 | AS | Assignment | Owner name: HONG FU JIN PRECISION INDUSTRY (SHENZHEN) CO., LTD Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHANG, CHIH-KUANG;WU, XIN-YUAN;HUANG, HUA;REEL/FRAME:020708/0527 Effective date: 20080325 Owner name: HON HAI PRECISION INDUSTRY CO., LTD., TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHANG, CHIH-KUANG;WU, XIN-YUAN;HUANG, HUA;REEL/FRAME:020708/0527 Effective date: 20080325 |

Oct 17, 2014 | FPAY | Fee payment | Year of fee payment: 4 |

Rotate