The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 03, 2015

Filed:

Oct. 15, 2009
Applicants:

Kang Ying Cai, Beijing, CN;

Yu Jin, Beijing, CN;

Zhi BO Chen, Beijing, CN;

Inventors:

Kang Ying Cai, Beijing, CN;

Yu Jin, Beijing, CN;

Zhi Bo Chen, Beijing, CN;

Assignee:

Thomson Licensing, Issy les-Moulineaux, FR;

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06G 7/48 (2006.01); H04W 16/20 (2009.01); G06F 17/50 (2006.01); G06T 17/20 (2006.01); G06F 17/10 (2006.01); H04W 28/06 (2009.01); H04W 84/18 (2009.01); H04W 88/04 (2009.01);
U.S. Cl.
CPC ...
H04W 16/20 (2013.01); G06F 17/5018 (2013.01); G06T 17/20 (2013.01); G06F 17/10 (2013.01); H04W 28/06 (2013.01); H04W 84/18 (2013.01); H04W 88/04 (2013.01);
Abstract

For most large 3D engineering models, the instance positions of repeating instances of connected components show significant multiple spatial aggregation. The invention uses several KD-trees, each for one cluster of points which are spatially aggregated. The multiple KD-trees generate a relatively short data stream, and thus improve the total compression ratio. A method for encoding points of a 3D mesh model comprises steps of determining that the mesh model comprises repeating instances of a connected component, and determining for each repeating instance at least one reference point, clustering the reference points of the repeating instances into one or more clusters, and encoding the clustered reference points using KD-tree coding, wherein for each cluster a separate KD-tree is generated.


Find Patent Forward Citations

Loading…