 |
|
|
|
|
|
 Title: |
US6184897:
Compressed representation of changing meshes and method to decompress
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Gueziec, Andre; Mamaroneck, NY
Taubin, Gabriel; Hartsdale, NY
|
| Assignee: |
International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2001-02-06
/ 1998-01-14
|
| Application Number: |
US1998000006771
|
| IPC Code: |
Advanced:
G06T 9/00;
G06T 17/20;
Core:
more...
IPC-7:
G06F 15/00;
|
| ECLA Code: |
G06T17/20; G06T9/00F;
|
| U.S. Class: |
Current:
345/440;
Original:
345/440;
|
| Field of Search: |
345/440,441,423,418,121
|
| Priority Number: |
| 1998-01-14 |
US1998000006771 |
| 1997-01-15 |
US1997000035014P |
|
| Abstract: |
A computer implemented representation and a method for encoding and decoding sequences of changes of a manifold triangular mesh. The representation is composed of a base manifold triangular mesh and a succession of specialized mesh surgery operations that may be of a different type. The methods encode or decode any sequence of mark, move, cut, delete, close, fill, or add operations. The mark operation specifies a type of mark and a set of marked elements. The move operation determines a set of displaced vertices from a set of marked elements, and applies a set of vertex displacements to the set of displaced vertices. The cut operation cuts the changing mesh through a set of marked edges. The close operation is applied to one or more boundaries that are determined when the type of mark is a boundary type, and the one or more boundaries are determined by a marked elements variable. The fill operation adds the triangles of a simple polygon to a manifold triangular mesh by establishing a one to one correspondence between a contiguous subset of boundary edges of the manifold triangular mesh and the same number of contiguous edges of a loop defined by the boundary of the simple polygon. The add operation is preferably specified by an incremental manifold triangular mesh and a sequence of stitches, where the incremental manifold triangular mesh is a manifold triangular mesh, and where a stitch is a one to one correspondence between a contiguous subset of boundary edges of one boundary of the manifold triangular mesh and the same number of contiguous edges of boundary edges of one boundary of the incremental manifold triangular mesh.
|
| Attorney, Agent or Firm: |
Sbrollini, Jay P.Perman & Green, LLP ;
|
| Primary / Asst. Examiners: |
Nguyen, Phu K.;
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
| Parent Case: |
CROSS-REFERENCE TO RELATED APPLICATIONS
This patent application claims priority under 35 U.S.C §1.119 from i) Provisional Patent Application No. 60/035,014, filed Jan. 15, 1997, entitled "Compressed Delta Surfaces" by G. Taubin et. al., ii) U.S. patent application Ser. No. 08/840,001, filed on Apr. 24, 1997, entitled "Method to Convert Non-Manifold Polyhedral Surfaces into Manifold Surfaces" by A. Gueziec and G. Taubin, iii) U.S. patent application Ser. No. 08/688,572, filed Jul. 30, 1996, now U.S. Pat. No. 5,825,369 entitled "Compression of Simple Geometric Models Using Spanning Trees" by J. Rossignac and G. Taubin, and iv) U.S. patent application Ser. No. 08/685,422 filed Jul. 30, 1996, now U.S. Pat. No. 5,905,507 entitled "Compression of Geometric Models Using Spanning Trees" by J. Rossignac and G. Taubin, and is related to U.S. patent application (Attorney Docket No. Y0997-004), filed concurrently herewith, entitled "Method for Generating and Applying Changes in the Level of Detail of a Polygonal Surface", by G. Taubin et al., all of which are herein incorporated by reference in their entirety.
|
| Family: |
Show 10 known family members
|
First Claim:
Show all 41 claims |
What is claimed is:
1. A method for encoding a representation of a three dimensional scene, comprising the steps of:
- generating surface data representing polygonal surfaces, the polygonal surfaces comprising a plurality of elements;
- generating first data representing a first operation with respect to elements of said polygonal surfaces;
- generating second data representing a second operation with respect to elements of the polygonal surfaces, wherein the second operation is different from the first operation, and wherein the first and second operations are performed in a predetermined sequence with respect to elements of the polygonal surfaces to generate a representation of a three dimensional scene; and
- performing the first and second operations in a predetermined sequence on the surface data with respect to elements of said polygonal surfaces to generate a representation of a three dimensional scene.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 9 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other Abstract Info: |
DERABS G2000-136501
|
| Other References: |
Gueziec, Andre, "Surface Simplification with Variable Tolerance", MRCAS '95, Nov. 4, 1995, 8 pages.
Taubin, Gabriel et al., "Geometric Compression Through Topological Surgery", RC20340 (#89924) Jan. 16, 1996 Computer Sciences, 22 pages.
Gueziec, Andre, et al., Cutting and Stitching; Efficient Conversion of a Non-Manifold Polygonal Surface to a Manifold, RC20935 (92693), Jul. 25, 1997, Computer Science/Mathematics, 32 pages.
Gueziec, Andre, "Surface Simplification Inside a Tolerance Volume", RC 20440(90191) May 20, 1997 Updated/Revised, Computer Science/Mathematics, 56 pages.
|
|
 Nominate this for the Gallery...
|
|
