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

Polygon fragmentation method of distortion correction in computer image generating systems

Assignee: Intel Corp
•
Filing: 1991-04-03
•
Granted: 1994-06-07
•
Expires: 2011-04-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for distortion correction of computer-generated textured images maps vertices and texture coefficients from viewer space to projector space, so that environmental objects are pre-distorted upon the projection raster in order to appear in their proper form and perspective when the raster is projected onto a curved surface in viewer space, and viewed therefrom. Distortion correction is carried out by utilizing a piecewise-linear approximation for smoothly, continuously and closely approximating the required pre-curvature. The viewing space raster is subdivided into a number of triangles, within each of which a linear approximation is applied to the image mapping: the raster faces are first subdivided along the lines of a rectangular grid and the face fragments falling within each rectangle are then subdivided along the grid diagonal. This produces face fragments which are small enough so that a linear approximation provides an accurate transformation of each fragment. Distortion maps, typically computed off-line and stored in a database memory, are utilized to project the edges and texture modulation gradients from view space back into projector space, so that the edges and texture patterns can now be matched at intersections of adjacent triangles, in a manner to be substantially devoid of any abrupt changes, and thus be properly pre-distorted.

Inventors

  • 👤 William A. Kelly
  • 👤 Lee T. Quick
  • 👤 Edward M. Sims
  • 👤 Michael W. Tackaberry

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 20:35
CPC Classifications
G; G06; G06T; G06T3/00

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 220 words
A method for pre-distorting a projection space PS video raster scene, formed of polygons having edges, to project upon a projection surface in a manner to be viewed as an undistorted VS video raster scene, having edge-defined polygons, by a viewer in viewer space VS, comprising the steps of: (a) assigning a regular undistorted array grid with a multiplicity of row and column lines to divide the VS raster into an array of cells; (b) arranging a diagonal line between one pair of opposite corners of each cell in the VS raster grid array; (c) determining in the VS raster an ordered set of all points (VS crossing points) at which each polygon edge crosses any of the grid and diagonal lines; (d) projecting each VS crossing point back into PS projection space to determine an associated PS space projected crossing point to which that VS crossing point will be transformed; (e) creating a line connecting each pair of projected PS crossing points which correspond to a pair of VS crossing points connected by an interconnecting polygon edge in the view raster, with a plurality of PS connecting lines thus created enclosing an associated PS raster area; and (f) matching textural area factors in each PS raster area thus formed to similar textural area factors in the corresponding VS area.
Claim 2
Independent Claim 220 words
A method for pre-distorting a projection space PS video raster scene, formed of polygons having edges, to project upon a projection surface in a manner to be viewed as an undistorted VS video raster scene, having edge-defined polygons, by a viewer in viewer space VS, comprising the steps of: (a) assigning a regular undistorted array grid with a multiplicity of row and column lines to divide the VS raster into an array of cells; (b) arranging a diagonal line between one pair of opposite corners of each cell in the VS raster grid array; (c) determining in the VS raster an ordered set of all points (VS crossing points) at which each polygon edge crosses any of the grid and diagonal lines; (d) projecting each VS crossing point back into PS projection space to determine an associated PS space projected crossing point to which that VS crossing point will be transformed; (e) creating a line connecting each pair of projected PS crossing points which correspond to a pair of VS crossing points connected by an interconnecting polygon edge in the view raster, with a plurality of PS connecting lines thus created enclosing an associated PS raster area; and (f) matching textural area factors in each PS raster area thus formed to similar textural area factors in the corresponding VS area.
Claim 3
Dependent Claim 21 words
The method of claim 1, wherein step (a) further includes the step of forming the VS raster grid with rectangular cells.
Claim 4
Dependent Claim 10 words
The method of claim 2, wherein each cell is square.
Claim 5
Dependent Claim 26 words
The method of claim 1, wherein step (b) further includes the step of providing all of the VS raster grid diagonal lines in the same direction.
Claim 6
Dependent Claim 15 words
The method of claim 4, wherein all of the diagonal lines have a positive slope.
Claim 7
Dependent Claim 38 words
The method of claim 1, wherein step (d) includes the steps of: storing a set of the equivalent VS and PS points for a predetermined VS-PS relationship; and retrieving the stored set whenever that VS-PS relationship is used.
Claim 8
Dependent Claim 24 words
The method of claim 6, wherein step (d) further includes the step of storing pre-computed transformation point sets for a multiplicity of VS-PS relationships.
Claim 9
Dependent Claim 20 words
The method of claim 7, wherein the pre-computed, stored sets cover expected a selected range of VS-PS projection angle relationships.
Claim 10
Dependent Claim 30 words
The method of claim 1, wherein step (f) includes the step of matching the VS areal texture to a calculated PS texture at each of the set of crossing points.
Claim 11
Dependent Claim 84 words
The method of claim 9, wherein the view space areal texture is a function having both a numerator N v and a denominator D v and the projection space areal texture is a function having both a numerator N p and a denominator D p , and step (f) includes the steps of: matching the PS numerator Np to the VS numerator Nv for each textured area; and simultaneously matching the PS denominator Dp to the VS denominator Dv for that same textured area.
Claim 12
Dependent Claim 23 words
The method of claim 10, wherein the textured area matches are sufficiently close so as to prevent abrupt modulation changes at area boundaries.

References Cited (Backward Citations)

US4763280A Cited
US4862388A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1997-06-06 1997-12-06 1998-06-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2001-06-06 2001-12-06 2002-06-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2005-06-06 2005-12-06 2006-06-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag