 |
|
|
|
|
|
 Title: |
US6307551:
Method for generating and applying changes in the level of detail of a polygonal surface
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Gueziec, Andre; Mamaroneck, NY
Lazarus, Francis; Pitiers, France
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-10-23
/ 1998-01-14
|
| Application Number: |
US1998000006988
|
| IPC Code: |
Advanced:
G06T 17/20;
Core:
more...
IPC-7:
G06T 15/00;
|
| ECLA Code: |
G06T17/20;
|
| U.S. Class: |
Current:
345/419;
Original:
345/419;
|
| Field of Search: |
345/419,423,428,429,441,442
|
| Priority Number: |
| 1998-01-14 |
US1998000006988 |
| 1997-01-15 |
US1997000035014P |
|
| Abstract: |
A computer implemented method is disclosed for increasing the level of detail of a polygonal surface. A first step of the method provides data in a memory of a computer (50) for representing a polygonal surface that is defined at least by a plurality of vertices, triangles and edges. Further steps of the method include providing a list of marked edges; cutting through the marked edges thereby creating new boundary vertices; applying displacements to the new boundary vertices thereby generating at least one hole in the surface, the hole being bounded by the displaced new boundary vertices; and filling the at least one hole with a forest of triangles. The step of providing data for representing the polygonal surface preferably includes a step of appending artificial vertices and triangles to the polygonal surface to fill potential boundary holes; and then subsequently removing or ignoring the artificial vertices and triangles when rendering the surface for display. Also disclosed is an improved data structure for representing a polygonal surface. The data structure is composed of a surface description containing a list of vertices and a list of triangles, said further includes data for specifying edge marks, vertex displacements, and a triangle forest.
|
| Attorney, Agent or Firm: |
August, Esq., CaseyPerman & Green, LLP ;
|
| Primary / Asst. Examiners: |
Nguyen, Tan; Nguyen, Thu
|
| 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 §119 from Provisional U.S. patent application Ser. No. 60,035,014, filed Jan. 15, 1997, entitled "Compressed Delta Surfaces" by A. Gueziec et al. This application claims priority under 35 U.S. U.S.C. 120 from 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, and U.S. patent application Ser. No. 08/688,572, filed Jul. 30, 1996, entitled "Compression of Simple Geometric Models Using Spanning Trees" by J. Rossignac and G. Taubin. This application is related to U.S. patent application Ser. No. 09,006,771 filed concurrently herewith, entitled "Compressed Representation of Changing Meshes and Method to Decompress", by G. Taubin et al. These applications are herein incorporated by reference in their entirety.
|
| Family: |
Show 10 known family members
|
First Claim:
Show all 9 claims |
What is claimed is:
1. A computer implemented method for increasing the level of detail of a polygonal surface, comprising steps of:
- providing data in a memory of a computer for representing a polygonal surface defined at least by a plurality of vertices, triangles and edges;
- providing a list of marked edges;
- cutting through the marked edges thereby creating new boundary vertices;
- applying displacements to the new boundary vertices thereby generating at least one hole in the surface, the hole being bounded by the displaced new boundary vertices; and
- filling the at least one hole with a forest of triangles,
- wherein each vertex is specified by a tuple of vertex coordinates, each triangle is specified by a triple of vertex indices, each edge is specified as a pair of vertex indices of a triangle, where a corner is a pair formed with a triangle and a vertex index of that triangle, where each vertex has a vertex ID, each triangle has a triangle ID, and each corner has a corner ID, and
- wherein the step of cutting through marked edges comprises:
- determining a set of vertices to be processed;
- forming corner groups from the corners associated with each vertex of the set of vertices;
- choosing a representative of a corner group as a corner of lowest ID;
- for each vertex of the set for which the associated number of corner groups is larger than one, replacing the corner group of lowest ID with the vertex; and
- for each said vertex, and for each additional corner group, replacing the corner group with a new vertex, such that new vertex IDs are attributed consecutively to corner groups in order of increasing corner group representative ID.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 5 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...
|
|
