← Back to Patent Explorer
US5522018A Expired / Lapsed US ⏱️ 0.0 years remaining

Sorting processing system and image synthesizing system using the same

Assignee: Bandai Namco Entertainment Inc
•
Filing: 1993-12-28
•
Granted: 1996-05-28
•
Expires: 2013-12-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A sorting processing system most suitable for use in an image synthesizing system processing images in real time is provided. A Z-representative value computing unit computes a Z-representative value from the Z-coordinate values of the respective vertices in a polygon which are inputted from a 3-D computing unit. The Z-representative value is inputted into a polygon shift value adder unit or polygon fixed Z-value setting unit to perform the addition of shift value or the setting of fixed Z-value for every polygon. An object shift value adder unit and object fixed Z-value setting unit perform the addition of shift value and the setting of fixed Z-value for every 3-D object. On the other hand, an absolute priority setting unit sets an absolute priority bit to which a shift value is added by polygon and object absolute priority shifting units for every polygon and 3-D object. A sorting Z-value is formed from the above computation results and then inputted into a sorting unit. According the priority determined by this sorting Z-value, the polygon image data is outputted toward an image supply unit.

Inventors

  • 👤 Masaki Takeda
  • 👤 Komei Kato

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 05:48
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/10; G06T15/40; G06T15/405; A; A63; A63F; A63F2300/00; A63F2300/60; A63F2300/66

Claims Analysis

Total Claims: 35
Claim 1
Independent Claim 165 words
A sorting processing system for receiving image data relating to a plurality of polygons defining a pseudo 3-D image, for sorting the image data of said polygons based on Z-coordinates which indicate the position of vertices of said polygons in the direction of view point, and for outputting the sorted image data, comprising: a sorting Z-value setting unit for computing a Z-representative value from the Z-coordinates of the vertices of each polygon and for setting said Z-representative value for every polygon as a sorting Z-value, and a sorting unit for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, wherein said sorting Z-value setting unit computes said Z-representative value from said Z-coordinates at the vertices in each polygon using a representative value setting pattern selected from a plurality of representative value setting patterns, said representative value setting pattern having been previously specified individually for each polygon for setting said Z-representative value corresponding to the characteristics of each polygon.
Claim 2
Dependent Claim 165 words
A sorting processing system for receiving image data relating to a plurality of polygons defining a pseudo 3-D image, for sorting the image data of said polygons based on Z-coordinates which indicate the position of vertices of said polygons in the direction of view point, and for outputting the sorted image data, comprising: a sorting Z-value setting unit for computing a Z-representative value from the Z-coordinates of the vertices of each polygon and for setting said Z-representative value for every polygon as a sorting Z-value, and a sorting unit for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, wherein said sorting Z-value setting unit computes said Z-representative value from said Z-coordinates at the vertices in each polygon using a representative value setting pattern selected from a plurality of representative value setting patterns, said representative value setting pattern having been previously specified individually for each polygon for setting said Z-representative value corresponding to the characteristics of each polygon.
Claim 3
Dependent Claim 109 words
A sorting processing system as defined in claim 1 wherein said representative value setting pattern used in said sorting Z-value setting unit is a pattern for selecting said Z-representative value from a group consisting of the minimum value of said Z-coordinates, the maximum value of said Z-coordinates and an average value between the minimum and maximum values; a pattern for selecting said Z-representative value from a group consisting of the maximum and average values: a pattern for selecting said Z-representative value from a group consisting of the minimum and average values; or a pattern for selecting said Z-representative value from a group consisting of the maximum and minimum values.
Claim 4
Dependent Claim 87 words
A sorting processing system as defined in claim 2 wherein said sorting Z-value setting unit includes a shift value adder unit for one of: adding a predetermined shift value to the computed Z-representative value at each polygon to form the sorting Z-value; adding a predetermined shift value to each of 3-D objects defined by a plurality of polygons to form the sorting Z-value; and adding a predetermined shift value to each polygon and also a predetermined shift value to each 3-D object to form the sorting Z-value.
Claim 5
Dependent Claim 82 words
A sorting processing system as defined in claim 3 wherein the sorting Z-value setting unit includes a fixed Z-value setting unit for forming said sorting Z-value by one of: setting the computed Z-representative value at a fixed value for every polygon, setting the computed Z-representative value at a fixed value for every 3-D object defined by a plurality of polygons and setting the computed Z-representative value at a fixed value for every polygon and at another fixed value for every 3-D object.
Claim 6
Dependent Claim 60 words
A sorting processing system as defined in claim 4 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 7
Dependent Claim 85 words
A sorting processing system as defined in claim 5 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 8
Dependent Claim 60 words
A sorting processing system as defined in claim 3 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority but controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 9
Dependent Claim 85 words
A sorting processing system as defined in claim 7 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 10
Dependent Claim 82 words
A sorting processing system as defined in claim 2 wherein the sorting Z-value setting unit includes a fixed Z-value setting unit for forming said sorting Z-value by one of: setting the computed Z-representative value at a fixed value for every polygon, setting the computed Z-representative value at a fixed value for every 3-D object defined by a plurality of polygons and setting the computed Z-representative value at a fixed value for every polygon and at another fixed value for every 3-D object.
Claim 11
Dependent Claim 60 words
A sorting processing system as defined in claim 9 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 12
Dependent Claim 85 words
A sorting processing system as defined in claim 10 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 13
Dependent Claim 60 words
A sorting processing system as defined in claim 2 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 14
Dependent Claim 85 words
A sorting processing system as defined in claim 12 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 15
Dependent Claim 87 words
A sorting processing system as defined in claim 1 wherein said sorting Z-value setting unit includes a shift value adder unit for one of: adding a predetermined shift value to the computed Z-representative value at each polygon to form the sorting Z-value, adding a predetermined shift value to each of 3-D objects defined by a plurality of polygons to form the sorting Z-value and adding a predetermined shift value to each polygon and also a predetermined shift value to each 3-D object to form the sorting Z-value.
Claim 16
Dependent Claim 82 words
A sorting processing system as defined in claim 14 wherein the sorting Z-value setting unit includes a fixed Z-value setting unit for forming said sorting Z-value by one of: setting the computed Z-representative value at a fixed value for every polygon, setting the computed Z-representative value at a fixed value for every 3-D object defined by a plurality of polygons and setting the computed Z-representative value at a fixed value for every polygon and at another fixed value for every 3-D object.
Claim 17
Dependent Claim 60 words
A sorting processing system as defined in claim 15 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 18
Dependent Claim 85 words
A sorting processing system as defined in claim 16 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 19
Dependent Claim 60 words
A sorting processing system as defined in claim 14 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 20
Dependent Claim 85 words
A sorting processing system as defined in claim 18 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 21
Dependent Claim 82 words
A sorting processing system as defined in claim 1 wherein the sorting Z-value setting unit includes a fixed Z-value setting unit for forming said sorting Z-value by one of: setting the computed Z-representative value at a fixed value for every polygon, setting the computed Z-representative value at a fixed value for every 3-D object defined by a plurality of polygons and setting the computed Z-representative value at a fixed value for every polygon and at another fixed value for every 3-D object.
Claim 22
Dependent Claim 60 words
A sorting processing system as defined in claim 20 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 23
Dependent Claim 85 words
A sorting processing system as defined in claim 21 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 24
Dependent Claim 60 words
A sorting processing system as defined in claim 1 wherein the sorting Z-value setting unit includes an absolute priority setting unit for setting an absolute priority bit at the high order bit of the sorting Z-value and said absolute priority bit controls the priority of each polygon independently of the value of the low order bit of the sorting Z-value.
Claim 25
Dependent Claim 85 words
A sorting processing system as defined in claim 23 wherein the sorting Z-value setting unit includes an absolute priority shifting unit for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for every 3-D object.
Claim 26
Dependent Claim 219 words
An image synthesizing system comprising an image supply unit for perspectively transforming a 3-D image represented by a plurality of 3-D polygons onto a 2-D plane at each of polygons corresponding to the 3-D polygons, for computing the image data of polygons defining a pseudo 3-D image, and for outputting the image data which include Z-coordinates indicating the position of vertices of said polygons in the direction of view point and data specifying a representative value setting pattern for setting a sorting Z-representative value corresponding to the characteristics of each of said polygons and a sort processing device for sequentially receiving the image data of the polygons and for sorting and outputting the polygon image data according to the Z-coordinates, comprising: a sorting Z-value setting unit for computing a Z-representative value, according to each respective representative value setting pattern, selected from a plurality of representative value setting patterns, at each polygon, from the Z-coordinates of the vertices of each polygon, the Z-representative value being set individually for each polygon as a sorting Z-value, and a sorting unit for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, said sorting Z-value setting unit computing the Z-representative value from the polygon vertex Z-coordinates, using said representative value setting pattern specified by said specifying data.
Claim 27
Dependent Claim 219 words
An image synthesizing system comprising an image supply unit for perspectively transforming a 3-D image represented by a plurality of 3-D polygons onto a 2-D plane at each of polygons corresponding to the 3-D polygons, for computing the image data of polygons defining a pseudo 3-D image, and for outputting the image data which include Z-coordinates indicating the position of vertices of said polygons in the direction of view point and data specifying a representative value setting pattern for setting a sorting Z-representative value corresponding to the characteristics of each of said polygons and a sort processing device for sequentially receiving the image data of the polygons and for sorting and outputting the polygon image data according to the Z-coordinates, comprising: a sorting Z-value setting unit for computing a Z-representative value, according to each respective representative value setting pattern, selected from a plurality of representative value setting patterns, at each polygon, from the Z-coordinates of the vertices of each polygon, the Z-representative value being set individually for each polygon as a sorting Z-value, and a sorting unit for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, said sorting Z-value setting unit computing the Z-representative value from the polygon vertex Z-coordinates, using said representative value setting pattern specified by said specifying data.
Claim 28
Dependent Claim 165 words
A sorting processing method for receiving image data relating to a plurality of polygons defining a pseudo 3-D image, for sorting the image data of said polygons based on Z-coordinates which indicate the position of vertices of said polygons in the direction of view point, and for outputting the sorted image data, comprising: a sorting Z-value setting step for computing a Z-representative value from the Z-coordinates of the vertices of each polygon and for setting said Z-representative value for every polygon as a sorting Z-value, and a sorting step for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, wherein said sorting Z-value setting step computes said Z-representative value from said Z-coordinates at the vertices in each polygon using a representative value setting pattern selected from a plurality of representative value setting patterns, said representative value setting pattern having been previously specified individually for each polygon for setting said Z-representative value corresponding to the characteristics of each polygon.
Claim 29
Dependent Claim 165 words
A sorting processing method for receiving image data relating to a plurality of polygons defining a pseudo 3-D image, for sorting the image data of said polygons based on Z-coordinates which indicate the position of vertices of said polygons in the direction of view point, and for outputting the sorted image data, comprising: a sorting Z-value setting step for computing a Z-representative value from the Z-coordinates of the vertices of each polygon and for setting said Z-representative value for every polygon as a sorting Z-value, and a sorting step for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, wherein said sorting Z-value setting step computes said Z-representative value from said Z-coordinates at the vertices in each polygon using a representative value setting pattern selected from a plurality of representative value setting patterns, said representative value setting pattern having been previously specified individually for each polygon for setting said Z-representative value corresponding to the characteristics of each polygon.
Claim 30
Dependent Claim 86 words
A sorting processing method as defined in claim 26, wherein said sorting Z-value setting step includes a shift value adder step for one of: adding a predetermined shift value to the computed Z-representative value at each polygon to form the sorting Z-value, adding a predetermined shift value to each 3-D object defined by a plurality of polygons to form the sorting Z-value, and adding a predetermined shift value to each polygon and also a predetermined shift value to each 3-D object to form the sorting Z-value.
Claim 31
Dependent Claim 82 words
A sorting processing method as defined in claim 26, wherein said sorting Z-value setting step includes a fixed Z-value setting step for forming said sorting Z-value by one of: setting the computed Z-representative value at a fixed value for every polygon, setting the computed Z-representative value at a fixed value for every 3-D object defined by a plurality of polygons and setting the computed Z-representative value at a fixed value for every polygon and at another fixed value for every 3-D object.
Claim 32
Dependent Claim 57 words
A sorting processing method as defined in claim 26 wherein said sorting Z-value setting step includes an absolute priority setting step for setting an absolute priority bit at the high order bit of the sorting Z-value, and said absolute priority bit controls the priority of each polygon independently to the low order bit of the sorting Z-value.
Claim 33
Dependent Claim 85 words
A sorting processing method as defined in claim 29 wherein said sorting Z-value setting setup includes an absolute priority shifting step for one of: adding a predetermined shift value to the absolute priority bit for every polygon, adding a predetermined shift value to the absolute priority bit for every 3-D object defined by a plurality of polygons and adding a predetermined shift value to the absolute priority bit for every polygon and another predetermined shift value to the absolute priority bit for each 3-D object.
Claim 34
Dependent Claim 218 words
An image synthesizing method comprising an image supply step for perspectively transforming a 3-D image represented by a plurality of 3-D polygons onto a 2-D plane at each of polygons corresponding to the 3-D polygons, for computing the image data of polygons defining a pseudo 3-D image, and for outputting the image data which include Z-coordinates indicating the position of vertices of said polygons in the direction of view point and data specifying a representative value setting pattern for setting a sorting Z-representative value corresponding to the characteristics of each of said polygons and a sort processing step for sequentially receiving the image data of the polygons and for sorting and outputting the polygon image data according the Z-coordinates, comprising: a sorting Z-value setting step for computing a Z-representative value according to each respective representative value setting pattern, selected from a plurality of representative value setting patterns, at each polygon from the Z-coordinates of the vertices of each polygon, the Z-representative value being set individually for each polygon as a sorting Z-value, and a sorting step for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, said sorting Z-value setting step computing the Z-representative value from the polygon vertex Z-coordinates, using said representative value setting pattern specified by said specifying data.
Claim 35
Dependent Claim 218 words
An image synthesizing method comprising an image supply step for perspectively transforming a 3-D image represented by a plurality of 3-D polygons onto a 2-D plane at each of polygons corresponding to the 3-D polygons, for computing the image data of polygons defining a pseudo 3-D image, and for outputting the image data which include Z-coordinates indicating the position of vertices of said polygons in the direction of view point and data specifying a representative value setting pattern for setting a sorting Z-representative value corresponding to the characteristics of each of said polygons and a sort processing step for sequentially receiving the image data of the polygons and for sorting and outputting the polygon image data according the Z-coordinates, comprising: a sorting Z-value setting step for computing a Z-representative value according to each respective representative value setting pattern, selected from a plurality of representative value setting patterns, at each polygon from the Z-coordinates of the vertices of each polygon, the Z-representative value being set individually for each polygon as a sorting Z-value, and a sorting step for permutating and outputting the polygon image data according to the priority defined by said sorting Z-value, said sorting Z-value setting step computing the Z-representative value from the polygon vertex Z-coordinates, using said representative value setting pattern specified by said specifying data.

References Cited (Backward Citations)

US5179717A Cited
US5335319A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-05-28 1999-11-27 2000-05-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-05-28 2003-11-27 2004-05-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-05-28 2007-11-27 2008-05-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag