Patent US6362833B2 successfully refreshed from Google Patents.
US6362833B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for progressively constructing a series of morphs between two-dimensional or three-dimensional models
Assignee: Intel Corp
•
Filing: 1998-04-08
•
Granted: 2002-03-26
•
Expires: 2018-04-08
Abstract
Abstract Morphing between two-dimensional or three-dimensional computer graphic models is accomplished by reducing given models from full resolution to low resolution ones between which the morph can be constructed either trivially or with simple user interaction, and then refining the morph using local searches as the two models are progressively refined back to full resolution.
Inventors
- 👤 Sanjeev N. Trika
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 17:27
CPC Classifications
G; G06; G06T; G06T13/00; G06T2210/00; G06T2210/44
Claims Analysis
Total Claims: 37
Claim 1
Independent Claim
77 words
A method of defining morphs between a first model having a first resolution and a second model having a second resolution comprising: (a) defining a first morph between the first model and the second model by automatically determining correspondence of vertices between the models; (b) increasing resolution of at least one of the models; and (c) defining a subsequent morph between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 2
Independent Claim
77 words
A method of defining morphs between a first model having a first resolution and a second model having a second resolution comprising: (a) defining a first morph between the first model and the second model by automatically determining correspondence of vertices between the models; (b) increasing resolution of at least one of the models; and (c) defining a subsequent morph between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 3
Dependent Claim
24 words
The method of claim 1 , further comprising reducing resolution of at least one of the first model and the second model before (a).
Claim 4
Dependent Claim
22 words
The method of claim 2 , wherein a reduced resolution of the first model is a lowest resolution for the first model.
Claim 5
Dependent Claim
22 words
The method of claim 2 , wherein a reduced resolution of the second model is a lowest resolution for the second model.
Claim 6
Dependent Claim
21 words
The method of claim 2 , further comprising repeating (b) and (c) until the first model is at the first resolution.
Claim 7
Dependent Claim
21 words
The method of claim 2 , further comprising repeating (b) and (c) until the second model is at the second resolution.
Claim 8
Dependent Claim
21 words
The method of claim 1 , wherein each of the first and second models comprise a two dimensional progressive polygon model.
Claim 9
Dependent Claim
21 words
The method of claim 1 , wherein each of the first and second models comprise a three dimensional progressive mesh model.
Claim 10
Dependent Claim
16 words
The method of claim 1 , wherein (b) comprises increasing resolution by at least one vertex.
Claim 11
Dependent Claim
21 words
The method of claim 9 , wherein increasing by at least one vertex comprises increasing resolution by more than one vertex.
Claim 12
Independent Claim
108 words
An apparatus for defining morphs between a first model having a first resolution and a second model having a second resolution comprising: a processing unit for executing programming instructions; and a storage medium having stored therein a plurality of programming instructions to be executed by the processing unit, wherein when executed, the plurality of programming instructions define a first morph between the first model and the second model by automatically determining correspondence of vertices between the models; increase resolution of at least one of the models; and define a subsequent morph between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 13
Independent Claim
108 words
An apparatus for defining morphs between a first model having a first resolution and a second model having a second resolution comprising: a processing unit for executing programming instructions; and a storage medium having stored therein a plurality of programming instructions to be executed by the processing unit, wherein when executed, the plurality of programming instructions define a first morph between the first model and the second model by automatically determining correspondence of vertices between the models; increase resolution of at least one of the models; and define a subsequent morph between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 14
Dependent Claim
33 words
The apparatus of claim 11 , wherein the programming instructions further comprise instructions to reduce resolution of at least one of the first model and the second model before determining a first morph.
Claim 15
Dependent Claim
22 words
The apparatus of claim 12 , wherein a reduced resolution of the first model is a lowest resolution for the first model.
Claim 16
Dependent Claim
22 words
The apparatus of claim 12 , wherein a reduced resolution of the second model is a lowest resolution for the second model.
Claim 17
Dependent Claim
40 words
The apparatus of claim 12 , wherein the programming instructions further comprise instructions to repeat increasing resolution and determining a subsequent morph until the first model is at the first resolution and the second model is at the second resolution.
Claim 18
Dependent Claim
20 words
The apparatus of claim 11 , wherein each of the first and second models are two dimensional progressive polygon models.
Claim 19
Dependent Claim
20 words
The apparatus of claim 11 , wherein each of the first and second models are three dimensional progressive mesh models.
Claim 20
Dependent Claim
24 words
The apparatus of claim 11 , wherein the programming instructions to increase resolution comprise programming instructions to increase resolution by at least one vertex.
Claim 21
Dependent Claim
24 words
The apparatus of claim 18 , wherein the programming instructions to increase resolution comprise programming instructions to increase resolution by more than one vertex.
Claim 22
Dependent Claim
121 words
A machine readable medium having stored therein a plurality of machine readable instructions executable by a processor, the machine readable instructions comprising instructions to define morphs between a first model having a first number of vertices and a second model having a second number of vertices by reducing the number of vertices of at least one of the first model and the second model, defining a first morph operation between the first model and the second model by automatically determining correspondence of vertices between the models; increasing the number of vertices of at least one of the models; and defining a subsequent morph operation between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 23
Dependent Claim
121 words
A machine readable medium having stored therein a plurality of machine readable instructions executable by a processor, the machine readable instructions comprising instructions to define morphs between a first model having a first number of vertices and a second model having a second number of vertices by reducing the number of vertices of at least one of the first model and the second model, defining a first morph operation between the first model and the second model by automatically determining correspondence of vertices between the models; increasing the number of vertices of at least one of the models; and defining a subsequent morph operation between the first model and the second model by automatically determining correspondence of vertices between the models.
Claim 24
Dependent Claim
47 words
The machine readable medium of claim 20 , wherein the machine readable instructions further comprise instructions to repeat increasing resolution and determining a subsequent morph until the first model is at the first number of vertices and the second model is at the second number of vertices.
Claim 25
Dependent Claim
33 words
The machine readable medium of claim 20 , wherein the first model is a two dimensional progressive polygon model and the number of vertices of the first model after the reducing is three.
Claim 26
Dependent Claim
33 words
The machine readable medium of claim 20 , wherein the second model is a two dimensional progressive polygon model and the number of vertices of the second model after the reducing is three.
Claim 27
Dependent Claim
33 words
The machine readable medium of claim 20 , wherein the first model is a three dimensional progressive mesh model and the number of vertices of the first model after the reducing is four.
Claim 28
Dependent Claim
33 words
The machine readable medium of claim 20 , wherein the second model is a three dimensional progressive mesh model and the number of vertices of the second model after the reducing is four.
Claim 29
Dependent Claim
32 words
The machine readable medium of claim 20 , wherein the programming instructions to increase the number of vertices comprise programming instructions to increase the number of vertices by more than one vertex.
Claim 30
Dependent Claim
25 words
The method of claim 1 , wherein increasing the resolution of at least one of the models comprises increasing the resolution automatically, without user intervention.
Claim 31
Dependent Claim
30 words
The apparatus of claim 11 , wherein the instructions for increasing the resolution of at least one of the models comprises instructions for increasing the resolution automatically, without user intervention.
Claim 32
Dependent Claim
32 words
The machine readable medium of claim 20 , wherein the instructions for increasing the resolution of at least one of the models comprises instructions for increasing the resolution automatically, without user intervention.
Claim 33
Dependent Claim
24 words
The method of claim 1 , wherein defining the first morph and defining the subsequent morph comprise automatically defining the morphs without user interaction.
Claim 34
Dependent Claim
28 words
The apparatus of claim 11 , wherein instructions for defining the first morph and defining the subsequent morph comprise instructions for automatically defining the morphs without user interaction.
Claim 35
Dependent Claim
30 words
The machine readable medium of claim 20 , wherein instructions for defining the first morph and defining the subsequent morph comprise instructions for automatically defining the morphs without user interaction.
Claim 36
Dependent Claim
20 words
The method of claim 1 , wherein the first model and the second model have a different number of vertices.
Claim 37
Dependent Claim
22 words
The machine readable medium of claim 20 , wherein the first model and the second model have a different number of vertices.
References Cited (Backward Citations)
US5448686A
Cited
US5590261A
Cited
US5969722A
Cited
US5963209A
Cited
US6057849A
Cited
US5945996A
Cited
US5886702A
Cited
US6094199A
Cited
US6031548A
Cited
US5966140A
Cited
US6147692A
Cited
US5990901A
Cited
US6009435A
Cited
US6285794B1
Cited
US6285372B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-03-25 | 2005-09-24 | 2006-03-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-03-25 | 2009-09-24 | 2010-03-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-03-25 | 2013-09-24 | 2014-03-26 | $7700.00 | Window Closed / Lapsed |