US5793382A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for smooth motion in a distributed virtual reality environment
Assignee: Mitsubishi Electric Research Laboratories Inc
•
Filing: 1996-06-10
•
Granted: 1998-08-11
•
Expires: 2016-06-10
Abstract
Abstract A system assures smooth motion in a distributed virtual reality environment by categorizing the information to be transmitted as to the predictability of future motion and applying appropriate smoothing algorithms based upon knowledge of what the future motion is likely to be. The system switches between a linear interpolation algorithm for less predictable data and a Catmull-Rom spline for more predictable data.
Inventors
- 👤 William Stephen Yerazunis
- 👤 Richard C. Waters
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 19:04
CPC Classifications
G; G06; G06T; G06T13/00
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
97 words
A system for assuring the smooth motion of a graphical object presented on-screen at a display at a recipient node on a network in which data is transmitted from a source node on said network to said recipient node, comprising: means at said source node for transmitting data corresponding to the intended motion of said graphical object at said recipient node including an indication of the predictability of the motion of said graphical object; and, means at said recipient node for receiving said data and said indication, and for smoothing said data in accordance with said indication.
Claim 2
Independent Claim
97 words
A system for assuring the smooth motion of a graphical object presented on-screen at a display at a recipient node on a network in which data is transmitted from a source node on said network to said recipient node, comprising: means at said source node for transmitting data corresponding to the intended motion of said graphical object at said recipient node including an indication of the predictability of the motion of said graphical object; and, means at said recipient node for receiving said data and said indication, and for smoothing said data in accordance with said indication.
Claim 3
Dependent Claim
51 words
The system of claim 1 wherein said indication includes means for dividing the predictability of said data into a number of categories dependent upon the number of future points specifiable, and means at said recipient node for applying different smoothing algorithms to said data based upon the category of said data.
Claim 4
Dependent Claim
23 words
The system of claim 2, wherein for a category in which there is no predictability said smoothing algorithm includes a linear extrapolation algorithm.
Claim 5
Dependent Claim
23 words
The system of claim 2, wherein for a category in which there is maximum predictability said smoothing algorithm includes the Catmull-Rom spline algorithm.
Claim 6
Dependent Claim
26 words
The system of claim 2, wherein for a category in which there is an intermediate amount of predictability said smoothing algorithm includes a linear interpolation algorithm.
Claim 7
Dependent Claim
37 words
The system of claim 1, and further including means for angle and phase unwrapping of the rotation of said graphical object so as to eliminate boundary effects when rotating said graphical object in excess of 360 degrees.
Claim 8
Dependent Claim
66 words
The system of claim 6, wherein said means for angle and phase unwrapping includes means for ascertaining a rotation of 360 degrees plus the desired rotation, means for ascertaining a desired rotation, means for ascertaining a rotation of the desired rotation minus 360 degrees, means for selecting which of said last-mentioned quantities is closest to the previous achieved rotation for the rotation of said graphical object.
Claim 9
Dependent Claim
38 words
The system of claim 1, and further including means for reducing the bandwidth of said data by transmitting only a portion of said data dependent upon the number of intended motions of said graphical object to be transmitted.
Claim 10
Dependent Claim
44 words
The system of claim 8, wherein said data is transmitted as packets of data and wherein said bandwidth reducing means includes means for transmitting a reduced-length packet when the number of motions of said graphical object to be transmitted is below a predetermined threshold.
Claim 11
Dependent Claim
27 words
The system of claim 1, wherein said data transmitting means includes means for specifying predictability based on the number of predictable future locations for said graphical object.
Claim 12
Dependent Claim
24 words
The system of claim 1, wherein said data transmitting means includes means for specifying the predictability based the type of graphical object being depicted.
Claim 13
Dependent Claim
52 words
The system of claim 1, wherein said data transmitting means includes means for transmitting data specific for a predetermined application, said predetermined application including means for designating the predictability of motion of said graphical object, and wherein said smoothing means includes means for selecting a smoothing algorithm based on said designated predictability.
Claim 14
Dependent Claim
33 words
The system of claim 1, wherein said data is transmitted in packetized form and wherein said smoothing means includes means for recognizing redundant packets and for discarding selected ones of said redundant packets.
Claim 15
Dependent Claim
44 words
The system of claim 1, wherein said data is transmitted in packetized form, each of said packets containing redundant data, said smoothing means including means for utilizing said redundant data to generate uninterrupted motion of said graphical object in the presence of lost packets.
Claim 16
Dependent Claim
58 words
The system of claim 1, wherein said source node includes means for timestamping said data, said recipient node including means to sort said data based on said timestamps, said recipient node including means to discard old data based on said timestamps, said recipient node including means to place said data into correct time order based on said timestamps.
References Cited (Backward Citations)
US5416899A
Cited
US5724074A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-10 | 2002-02-09 | 2002-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-10 | 2006-02-09 | 2006-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-10 | 2010-02-09 | 2010-08-11 | $7700.00 | Window Closed / Lapsed |