Interface and method of interfacing between a parametric modelling unit and a polygon based rendering system

Inactive Publication Date: 2004-06-17
IMAGINATION TECH LTD
View PDF10 Cites 50 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

A major disadvantage of modelling using high order surfaces is that it introduces added complexity in the rasterization stage of the rendering system.
Rational patches have certain modelling advantages over the simpler non-rational variety but can be slightly more complex to process in some respects.
We have appreciated that for a hardware implementation this is not practical for two reasons: internal (i.e. on-chip) storage is expensive and the retrieval of large amounts of externally stored data can cause a bottleneck in the performance of the system.
A second problem which occurs when interfacing between parametric data and polygon based data in a combined graphics system is that different levels of subdivision may be required to convert parametric data relating to a first patch and parametric data relating to a second patch, where the first and second patches represent adjacent areas of the object being modelled.
If conversion of adjacent patches is not constrained to apply the same level of subdivision to each patch, then cracks can appear in the modelled object because the surface with the higher level of subdivision has extra sample points and thus potentially a slightly different shape.
However, this results in some patches being excessively subdivided when they could be tessellated adequately at a less divided level and does not target the processing to the areas where it is necessary to produce adequate results.
Unfortunately, such connecting meshes may introduce abrupt changes in surface direction.
We have also appreciated that stitching the edges of adjacent patches together is computationally intensive and requires the stitching mesh to be regenerated as the subdivision level changes.
Although this scheme is mathematically correct, it has a subtle flaw.
Computer graphics hardware has limited precision and is unable to represent exact polygon vertex locations.
It is therefore frequently impossible to exactly place a flattened vertex on the shared boundary.
This leads to problems caused by "T-Joints", as well known in the art.
We have appreciated that these T-Joints could be fixed by again introducing stitching polygons,.however this is a rather inefficient approach since such polygons are tiny and the `set-up` costs involved in polygon rendering would be better utilised on more significantly sized polygons.
This methord generates vast amounts of data and is not really suitable for real-time rendering.
1) Subdivide all patches of the model to the same subdivision level, This is simple but wasteful of resources.
It is not ideal as the stitching polygons are additional costs and can induce abrupt changes in direction (as seen in FIG. 5a).
3) Use Clark's method, allowing non-uniform subdivision even within patches, but suffer from T-Joint problems.
4) Apply further stitching polygons to Clark's method.
5) Subdivide the mesh into micro-polygons.
A further problem with known interfacing techniques is so-called polygon popping.
Thus increasing the subdivision ratio even a small amount may cause the actual level of subdivision to increase dramatically.
Unless this process is well controlled it causes undesirable visual effects in the animation as shown in FIG. 3.
Unfortunately, this calculation can frequently fail.
This means that one or both of the first partial derivates may be zero, resulting in an incorrect normal.
This is rather unfortunate as such surface arrangements of control points are often needed to model completely valid shapes and can easily be generated by modelling software packages.
This will usually provide an adequate result, but is costly in terms of additional calculation.
Unfortunately, even this approach can fail.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Interface and method of interfacing between a parametric modelling unit and a polygon based rendering system
  • Interface and method of interfacing between a parametric modelling unit and a polygon based rendering system
  • Interface and method of interfacing between a parametric modelling unit and a polygon based rendering system

Examples

Experimental program
Comparison scheme
Effect test

case 1

[0174]

[0175] Starting with the numerator / denominator `contents` we have 15 lim e 0 1 e B _ Delta= lim e 0 [ e 2e 1 0] Q P _ left -column xyz P 00 w - P _ 00 xyz [ e 2e 1 0] QP left - column w = [0 0 1 0] Q P _ left -column xyz P 00 w - P _ 00 xyz [0 0 1 0] QP left -column w = [ - 3 3 0 0] P _ left -column xyz P 00 w - P _ 00 xyz [ - 33 0 0] QP left - column w =3 ((P _ 10 xyz P _ 00 xyz )P 00 w-P _ 00 xyz ( P 10 w - P 00 w) ) =3 (P 10 xyz P 00 w-P _ 00 xyz P 10 w )

[0176] The limit clearly exists and will be non-zero if and only if {overscore (P)}.sub.10.sub..sub.xyzP.sub.00w.noteq.P.sub.00xyzP.sub.10w. If this condition holds then a tangent vector in the direction S is given by {overscore (T)}.sub.S1={overscore (P)}.sub.10.sub..sub.xyzP.sub.00w.no-teq.P.sub.00xyzP.sub.10.sub..sub.w. Note that the length of the vector is immaterial at this point.

case 2

[0177]

[0178] if the condition of case 1 is not met, (i.e. {overscore (P)}.sub.10.sub..sub.xyzP.sub.00w.noteq.P.sub.00xzyP.sub.10.sub..sub.w), then the limits of the second case are examined. This gives: 16 lim e 0 1 e 2 B _ Delta( e , 0 ) = lim e 0 1 e (B _ Delta( e , 0 ) )

[0179] Noting that . . . 17 1 e B _ Delta( e , 0 )= [ e 2e 1 0] Q P _ left_column xyz P 00 w - P _ 00 xyz [ e 2e 1 0] QP left_column w = [ e 2e 0 0] Q P _ left_column xyz P 00 w - P _ 00 xyz [ e 2e 0 0] QP left_column w+ [0 0 1 0] Q P _ left_column xyz P 00 w -P _ 00 xyz [0 0 1 0] QP left_column w

[0180] . . . we see that the second part of the sum is the same as the result from case 1, which have assumed to be zero. We thus get 18 lim e 0 1 e 2 B Delta( e , 0 ) = lim e 0 1 e[ e 2e 0 0]Q P _ left column xyz P 00 w - P _ 00 xyz [ e 2e 0 0] QP left_column w = lim e 1 e[ e e 0 0]Q P _ left_column xyz P 00 w - P _ 00 xyz [ e e 0 0] QP left_column w = [0 1 0 0] Q P _ left_column xyz P 00 w - P _ 00 xyz [ 0 1 0 0] QP lef...

case 3

[0183]

[0184] Should both cases 2 and 3 fail, then using a similar argument to these presented, an "S" may be computed from {overscore (T)}.sub.03={overscore (P)}.sub.30.sub..sub.xyzP.sub.00w-{overscore (P)}.sub.00xyz{overscore (P)}.sub.30.sub..sub.w, provided that is non zero.

[0185] Derivation of a Candidate Tangent Vector in the `T` Direction:

[0186] This follows exactly the same reasoning as for the "S" tangent, and so will not be discussed here.

[0187] Derivation of a Candidate Tangent Vector in the `diagonal` Direction:

[0188] If the {overscore (T)}.sub.S.alpha. and {overscore (T)}.sub.T.beta. candidate tangent are linearly dependent then by themselves they are not suitable for generating the normal vector. In this case it is necessary to manufacture another tangent candidate, which will be referred to as the `diagonal` tangent candidate.

[0189] For the purposes of the preferred embodiment, it is assumed that at least one of {overscore (T)}.sub.S.alpha. or {overscore (T)}.sub.T.beta...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

An interface for use in a 3-d graphics system comprising a parametric modelling unit for modelling objects as high order surfaces, and a polygon based rendering system for rendering polygon modelled objects for display. The interface comprises an input for receiving data and a subdivision unit coupled to the input for processing the data. The interface includes a converter coupled to the subdivision unit for determining from leaf patch data a first plurality of values representing vertices of tessellating polygons describing the leaf patch, and for determining from sub-leaf patch data a second plurality of values representing the vertices of tessellating polygons describing the sub-leaf patch. The interface also has a combiner, coupled to the converter, for combining the values to form leaf polygon data defining the polygon vertices at a first subdivision level, and an output coupled to the combiner for outputting the leaf polygon data.

Description

[0001] This invention relates to an interface for use in a 3-d graphics system comprising a parametric modelling unit and a polygon based rendering system.BACKGROUND TO THE INVENTION[0002] Traditional 3D rendering systems use a mesh of polygons (usually triangles) to model the objects within a scene. Triangles have the advantage that they are of a simple form, and it is therefore relatively easy to perform operations such as transformation, lighting, texturing and rasterization on them in order to produce an image for display.[0003] A known alternative to modelling objects using a mesh of polygons is to segment the object into areas and fit a number of curved, high order surfaces, frequently termed patches, to the different areas of the object being modelled. These patches are generally defined as parametric surfaces with the surface shape governed by a grid of control points. An advantage of using high order surfaces is that the set of control points usually requires a much smaller...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T17/30G06T17/20
CPCG06T17/30G06T17/20G06T17/00
Inventor FENNEY, SIMONREDSHAW, JONATHAN MARKRUSSELL, JOHNGIBSON, CLIFFORD
Owner IMAGINATION TECH LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products