# US 2006/0152506 A1 · Method for generating 3D mesh based on unorganized sparse 3D points

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0152506 A1
- Document ID: US20060152506A1
- Status: Published application
- Kind: A1
- Application number: 11/205,427
- Filed: 2005-08-17
- Published: 2006-07-13
- Earliest claimed: 2004-12-13
- Assignees: Electronics and Telecommunications Research Institute
- Inventors: Chang-Woo Chu; Bon-Ki Koo; Jea-Chul Kim; Byoung-Tae Choi; Hyun-Bin Kim
- Web page: https://patentgrep.com/patent/US20060152506A1

## CPC

- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Provided is a method for generating a three-dimensional (3D) mesh based on unorganized sparse 3D points to generate a mesh model that displays a 3D surface by using unorganized sparse 3D points extracted from a plurality of two-dimensional image. The 3D mesh generating method based on unorganized sparse 3D points includes the steps of: receiving a plurality of unorganized sparse 3D points, a plurality of two-dimensional (2D) corresponding point information, and images; generating an initial mesh by using the received 2D corresponding information; removing an abnormal face from the initial mesh; checking if unused 2D corresponding point information exists among the received 2D corresponding point information; if unused 2D corresponding point information exists, reorganizing the initial mesh by performing a constrained Delaunay triangulation; and if unused 2D corresponding point information does not exist in the result of the confirmation, generating a final mesh.

## Claims

### Claim 1

A method for generating a three-dimensional (3D) mesh generating method based on unorganized sparse 3D points, comprising the steps of:
a) receiving a plurality of unorganized sparse 3D points, a plurality of two-dimensional (2D) corresponding point information, and images;
b) generating an initial mesh by using the received 2D corresponding information;
c) removing an abnormal face from the initial mesh;
d) determining if unused 2D corresponding point information exists among the received 2D corresponding point information;
e) if unused 2D corresponding point information exists, reorganizing the initial mesh by performing a constrained Delaunay triangulation; and
f) if unused 2D corresponding point information does not exist in the result of the confirmation, generating a final mesh.

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein, in the step b), the initial mesh is generated by using 2D corresponding point information extracted from an initial image that includes a maximum of the unorganized sparse 3D points.

### Claim 3 (depends on 1)

The method as recited in claim 1, wherein the step c) includes the steps of;
c1) obtaining a texture of each face in the initial mesh by using the initial image;
c2) comparing the texture of each face in the initial mesh with the texture of a face of another image which corresponds to the face of the initial mesh;
c3) if the textures are the same, determining the face as a normal face and maintaining the face;
c4) if the textures are not the same and re-comparing the texture of each face of the initial mesh with the texture of a corresponding face in an image photographed in another position, exchanging an edge with respect to neighboring three faces;
c5) if the textures are the same, determining the face of the initial mesh as a normal face and maintaining the face of the mesh with the swapped edge; and
c6) if the textures are not same, removing the face of the initial mesh by determining the face of the initial mesh as the abnormal face.

### Claim 4 (depends on 3)

The method recited in claim 3, wherein in the step e) the mesh is reorganized based on the connection relationship between 2D corresponding point information or coordinates extracted from a next image and 2D corresponding point free from the connection relationship in the initial image, while a normal face is maintained in the generated mesh.
