US20070188487A1 - Efficient triangular shaped meshes - Google Patents
Efficient triangular shaped meshes Download PDFInfo
- Publication number
- US20070188487A1 US20070188487A1 US11/548,242 US54824206A US2007188487A1 US 20070188487 A1 US20070188487 A1 US 20070188487A1 US 54824206 A US54824206 A US 54824206A US 2007188487 A1 US2007188487 A1 US 2007188487A1
- Authority
- US
- United States
- Prior art keywords
- triangle
- row
- vertices
- vertex
- primitives
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
Definitions
- This invention relates generally to graphics, and more particularly, to the rendering triangular shaped meshes from triangle shaped graphics primitives.
- triangle graphic primitives can be aggregated into triangle strips.
- the triangle strips comprise a row of triangle primitives aggregated together in alternating apex-orientations, both upwards and downwards.
- Triangle strips are typically a flexible unit of computer graphic manipulation because they can represent a single triangle (that is, a “three vertex” triangle strip), a single quadrilateral (that is, a “four vertex” triangle strip), or a rectangular lattice comprising a plurality of vertically-aggregated triangle strips.
- a rectangular lattice is generally defined as a rectangular two-dimensional aggregation of a plurality of rows of triangle strips, wherein internal vertices are repeated during transmission.
- Employing triangle strips can be reasonably data efficient for the transmittal and rendering of long aggregations of triangle primitives to create a single row. This is because, in a triangle strip, the number of vertices per graphical triangle shaped primitive approaches the ratio of one to one, thereby necessitating the transmission of a minimum number of vertices to render (that is, to graphically recreate and display) a triangular strip.
- Subdivision surfaces that is, the graphical technique of segmenting a given shape into constituent sub-shapes, are becoming ever more widely employed in graphics.
- subdivision can be especially inefficient with respect to data transfer overhead, particularly when triangle strip data is generated. This is typically because, similar to a rectangular lattice, internal row vertices are repeated. In the limit (that is, as the subdivision level approaches infinity), the efficiency approaches 50%.
- a second approach to graphical design is to directly support basic graphical primitives so that internal row vertices need not be repeated. This creates a mesh, such as a rectangular mesh.
- a rectangular mesh is generally defined as a rectangular aggregation of graphics primitives, wherein the rectangular aggregation of graphics primitives did not occur due to the two-dimensional aggregation of a plurality of triangle strips.
- the renderer caches both the previous row of vertices of a given row of aggregated triangle-shaped or quadrilateral-shaped primitives. Then, instead of receiving both rows of vertices for the next row of aggregated triangle-shaped or quadrilateral-shaped primitives, the renderer only receives the top row of vertices for the next row of aggregated triangle-shaped or quadrilateral-shaped primitives, thereby reducing the transmitted information needed to draw the rectangular mesh and increasing efficiency. Rendering a rectangular mesh can be more efficient than rendering a rectangular lattice created by the aggregation of primitive strips.
- the present invention employs video information associated with a triangular mesh.
- the present invention derives a plurality of adjacent triangle-shaped primitives of a first row.
- Each triangle-shaped primitive is defined as having both at least one lower vertex and at least one upper vertex.
- At least one lower vertex and at least one upper vertex of a selected triangular primitive of the first row are cached.
- At least one lower vertex of the selected triangle primitive is overwritten with at least one upper vertex of the selected triangular primitive.
- One or more new upper vertexes of a selected triangle primitive of the next row are cached, thereby generating a triangular mesh.
- FIG. 1A illustrates a 3-dimensional shape having a triangular mesh, wherein the triangular mesh is further subdivided into triangular graphics primitives;
- FIG. 1B illustrates a more-detailed triangular mesh, wherein the triangular mesh has been further subdivided into triangular graphics primitives
- FIG. 2 illustrates a method for employing and rendering display information associated with a triangular mesh
- FIG. 3 illustrates a “C” pseudo-code subroutine, drawTriangualarMesh( ), employable for the rendering of a triangular mesh by a video device.
- all functions described herein may be performed in either hardware or software, or some combination thereof.
- the functions are performed by a processor, such as a computer or an electronic data processor, in accordance with code, such as computer program code, software, and/or integrated circuits that are coded to perform such functions, unless indicated otherwise.
- the computer program is embodied upon or within a computer program product, such as a floppy disk or compact disk, or other storage medium.
- an octahedron 100 subdivided into a triangular shape 105 , wherein the triangular shape is one triangle base of the octahedron 100 .
- the octahedron 100 is further subdivided into triangular meshes 150 .
- the triangular mesh 150 is subdivided into triangle primitives 155 . Therefore, the triangular shape 105 also comprises a triangular mesh 150 .
- Each triangle primitive 155 has its own unique set of defined vertices, although a vertex element of a unique set of defined vertices can be shared with another triangle primitive 155 .
- triangular shape 105 Generally, the subdivisions of triangular shape 105 occur to more effectively enable the creation or generation (that is, the mathematical calculation) and more accurate rendition (that is, the final display) of a given shape, such as a triangular shape.
- One subdivision unit of utility is the triangle primitive.
- a given shape, such as triangular shape 105 is ultimately subdivided into constituent elements, such as triangle primitives 155 .
- the ultimate subdivision of triangular shape 105 into triangle primitives 155 is a technique of great utility in graphics systems.
- the triangle primitives 155 of triangular shape 105 are defined in relation to one another to comprise the triangular mesh 150 .
- each triangular mesh 150 is a result of both a subdivision of the triangular shape 105 and the further subdivision of this subdivision into triangle primitives 155 . Therefore, the triangular shape 105 is also a triangular mesh, as it comprises triangle primitives 155 and triangular meshes 150 .
- the triangular shape 105 with its constituent unique vertices of the various triangle primitives 155 , is typically generated in a microchip or some other graphics calculation device. Any unique vertices are then transmitted to a video display device for rendering. Unique vertices of the triangle primitives 155 are generally defined as vertices derived for the purpose of rendering graphical primitives, but these vertices are not duplicated during transmission. The unique vertices are received by the video display device and employed in the rendering of the triangular mesh 150 .
- rendering the triangular mesh 150 on the display device is performed through the transmission of the bottom row of vertices, then the transmission of the upper row of vertices of a triangular strip.
- Triangle primitives are not rendered until the top vertices are received.
- the rendering of the triangular mesh 150 is generally accomplished through transmitting both the top and bottom vertices of the first row of triangle graphics primitives 155 . These transmittances can occur from the graphics calculator or processor and then storing the vertices in a local storage center, such as a vertex cache of the video device.
- the video device renders the first row of adjacent triangle primitives 155 .
- the video buffer then overwrites the cached unique lower vertices of the first row of graphical primitives 155 with the values of the cached unique upper vertices of the first row of graphical primitives 155 . This creates a new unique set of lower vertices employable for rendering the next row of graphical primitives 155 .
- Employing overwriting avoids the necessity of a substantial duplication of transmission of the vertices in common between rows between the graphics calculation device and the display device.
- the graphics calculation device then sends the top unique vertices of the next row of triangle primitives 155 of the triangular mesh 150 to the video device.
- the video display device renders a new row. The process continues until the apex of the triangular shape is reached, whereupon this last unique vertex is sent for the apex triangle primitive 155 . Calculations are made to allow for the decreasing number of unique upper vertices per higher row.
- the rendered triangular shape 105 comprises triangular meshes 150 .
- the rendered shape does not comprise a triangular lattice.
- a triangular lattice is generally defined as a triangular two-dimensional aggregation of a plurality of rows of triangular strips, wherein internal vertices have been repeated during transmission.
- the triangular mesh 150 was created and rendered through the transmission and employment of unique vertices, not through the aggregation of triangle strips, thereby substantially reducing data transmission inefficiencies.
- FIG. 1B illustrates the triangular mesh 150 , wherein the triangular mesh 150 is further subdivided and comprises triangle primitives 155 .
- the triangular mesh 150 comprises 16 triangle primitives.
- the triangle graphics primitives are illustrated as numbered from 1 to 16 , and are placed in four rows.
- the first row comprises triangle primitives 1 through 7 , inclusive.
- the second row comprises triangle primitives 8 through 12 , inclusive.
- the third row comprises triangle primitives 13 through 15 , inclusive.
- the fourth row comprises triangle primitive 16 .
- the triangular mesh 150 can comprise more than four rows of triangle primitives 155 .
- each row the base of a first triangle primitive 155 and the last triangle primitive 155 within the selected row is oriented to the bottom of the triangular mesh 150 .
- the remaining triangle primitives alternate in orientation. In other words, contiguous to the triangle primitive “ 1 ”, the apex of which is oriented to the top of the triangular mesh 150 , there is a triangle primitive “ 2 ”, the apex of which is oriented to the base of the triangular mesh 150 , and so on. This alternation continues until the last triangle primitive is reached per row, wherein the apex of the last triangle primitive is oriented to the apex of the triangular mesh 150 .
- triangle primitives “ 1 ” through “ 7 ” of row 1 have vertices associated with them.
- Triangle primitive “ 1 ” of row 1 is defined by the bottom vertices “ 1 ” and “ 2 ” and the top vertex “ 6 .”
- Triangle primitive “ 2 ” of row 1 is defined by the bottom vertex “ 2 ” and the top vertices “ 6 ” and “ 7 ”.
- Triangle primitive “ 3 ” of row 1 is defined by the bottom vertices “ 2 ” and “ 3 ” and the top vertex “ 7 ”, and so on.
- the top vertices of the triangle graphics primitives of row 1 are defined as the bottom vertices of the triangle vertices of row 2 .
- vertex “ 6 ”, the top vertex of triangle primitive “ 1 ” of row 1 , and vertex “ 7 ”, the top vertex of triangle primitive “ 2 ” of row 1 are defined as the bottom vertices of triangle primitive “ 8 ” in row 2 .
- Vertex “ 7 ”, the top vertex of triangle primitive “ 3 ” of row 1 , and vertex “ 8 ”, the top vertex of triangle primitive “ 5 ” of row 1 are defined as the bottom vertices of triangle primitive “ 10 ” in row 2 .
- the redefining of the top vertices of a prior row as the bottom vertices of a consecutive row is continued until defining the upper vertex of the triangle primitive of the final row. In the illustrated embodiment, this is triangle primitive “ 16 ”.
- the lower vertices of each triangle primitive of a higher-order row are defined as a function of the upper vertices of the triangle primitives of a lower-order row (for example, row 2 ). Therefore, the triangular mesh 150 can be rendered with the transmission of only unique vertices. Employment of only unique vertices to construct a triangular mesh requires a transmission of a lesser number of vertices than is required to construct a triangular lattice, of the same shape and size, from the vertical aggregation of a plurality of triangle strips.
- the “level” is generally defined as the number of bisections performed, that is level “0” is a unitary triangle, level “1” is a bisected triangle, level “2” is a bisected triangle wherein each bisection has been further bisected, and so on.
- the “alternate level” is generally defined as a triangle that has been subdivided into a given number of equal subdivisions. In other words, an alternate level of 0 represents a unitary triangle, an alternate level of 1 represents a subdivided bisected triangle, an alternate level of 2 represents a subdivided trisected triangle, and so on. In other words, alternate levels comprise subdividing a triangle to the nth division (“n-sectioning), such as a bisection, a trisection, and so on.
- n-sectioning such as a bisection, a trisection, and so on.
- Unique mesh vertices are generally defined as the number of vertices required to construct a subdivided triangular mesh
- triangle strip vertices are generally defined as the number of vertices required to construct a subdivided triangle lattice from triangle strips.
- Efficiency is a comparison of the efficiency of employing triangle strip vertices for constructing a triangular shape to employing the unique vertices of a triangular mesh to create a triangular shape. Alternate Unique Triangle Level Level Mesh Vert. Strip Vert.
- the method 200 calculates the vertices of the graphics primitives that represent subdivisions of a triangular shape 105 .
- the subdivisions comprise triangle primitives.
- the method 200 transmits unique vertices to the video device.
- the video device renders the triangle graphics primitives as the triangular mesh 150 .
- the graphics processor calculates and derives the unique vertex coordinates for the subdivided triangular area 105 .
- the triangular area 105 is then subdivided into triangle graphics primitives, creating a triangular mesh 150 .
- the subdividing comprises a bisection. As will be understood by those of skill in the art, other subdivision sub-secting schemes are within the scope of the present invention.
- the graphics processor transmits the plurality of unique vertices for a selected row to the video display. If the unique vertices to be transmitted contain the lower vertices of the bottom row, both the upper and lower vertices of the first row are transmitted, wherein first all of the lower vertices are transmitted, then all of the upper vertices are transmitted. If the vertices to be transmitted do not contain the lower vertices of the bottom row, only the upper vertices are transmitted for the row.
- step 230 the video device caches the values of the vertices of the triangle primitives as derived in step 210 and transmitted in step 220 , wherein first all of the lower vertices are transmitted, then all of the upper vertices are transmitted. If the vertices to be transmitted contain the lower vertices of the bottom row, both the upper and lower vertices are cached in the step 230 . If the received vertices do not contain the lower vertices of the bottom row, only the upper vertices for the row are transmitted in step 220 and received and cached in step 230 .
- the video device renders the triangle primitive or primitives 155 .
- the rendering process is performed by the video device further comprises the steps of lighting, shading, and texture/displacement mapping the triangle primitive 155 .
- step 250 if the rendering graphical object is finished, that is, if the apex vertex of the apex triangle primitive has been received, then stop step 275 is executed. In other words, the triangular mesh 150 has been rendered. If the apex vertex of the apex triangle primitive has not yet been received, step 260 is executed.
- step 260 the video display overwrites the values of the lower vertices of the newly transmitted row with the values of the higher vertices of the previously transmitted row. Therefore, the higher vertices of the previous row become the lower vertices of the next row.
- step 270 the next row to be transmitted is incremented (for example, from row 2 to row 3 ).
- step 220 the graphics processor transmits the higher vertices of this new row, and so on.
- the MAX_MESH_WIDTH variable equals the maximum number of vertices in the bottom row of the subdivided triangle, such as the triangular mesh 150 .
- MAX_MESH_WIDTH is the maximum allowable “width” parameter.
- renderTriangle( ) is called to render 0, 1, or 2 triangle primitives for each vertex received. Zero triangle primitives are rendered for the first (“width”) row of vertices. One triangle primitive is rendered for the first vertex of each row. Two triangle primitives are rendered for each subsequent vertex. The subroutine renderTriangle( ) also renders the triangle primitive in a higher row. This continues until the very highest row, which comprises only a single triangle primitive.
Abstract
The present invention renders a triangular mesh for employment in graphical displays. The triangular mesh comprises triangle-shaped graphics primitives. The triangle-shaped graphics primitives represent a subdivided triangular shape. Each triangle-shaped graphics primitive shares defined vertices with adjoining triangle-shaped graphics primitives. These shared vertices are transmitted and employed for the rendering of the triangle-shaped graphics primitives.
Description
- This application is a division of, and claims the benefit of the filing date of, co-pending U.S. patent application Ser. No. 10/242,523 entitled Efficient Triangular Shaped Meshes, filed Sep. 12, 2002.
- This invention relates generally to graphics, and more particularly, to the rendering triangular shaped meshes from triangle shaped graphics primitives.
- In computer graphics, various graphical shapes are created and rendered by the employment of basic graphical building blocks, known as graphics primitives. One widely-used graphics primitive is a triangle graphic primitive. Triangle primitives can be aggregated into triangle strips. The triangle strips comprise a row of triangle primitives aggregated together in alternating apex-orientations, both upwards and downwards. Triangle strips are typically a flexible unit of computer graphic manipulation because they can represent a single triangle (that is, a “three vertex” triangle strip), a single quadrilateral (that is, a “four vertex” triangle strip), or a rectangular lattice comprising a plurality of vertically-aggregated triangle strips. A rectangular lattice is generally defined as a rectangular two-dimensional aggregation of a plurality of rows of triangle strips, wherein internal vertices are repeated during transmission.
- Employing triangle strips can be reasonably data efficient for the transmittal and rendering of long aggregations of triangle primitives to create a single row. This is because, in a triangle strip, the number of vertices per graphical triangle shaped primitive approaches the ratio of one to one, thereby necessitating the transmission of a minimum number of vertices to render (that is, to graphically recreate and display) a triangular strip.
- However, the employment of triangle strips to render a rectangular lattice entails inefficiencies. Generally, the inefficiencies are because each row of vertices internal to the rectangular lattice has to be repeated. For instance, a rectangular lattice, comprising 24 equilateral triangles, actually requires 30 strip vertices to be rendered (eight triangles per row by three rows).
- Subdivision surfaces, that is, the graphical technique of segmenting a given shape into constituent sub-shapes, are becoming ever more widely employed in graphics. However, subdivision can be especially inefficient with respect to data transfer overhead, particularly when triangle strip data is generated. This is typically because, similar to a rectangular lattice, internal row vertices are repeated. In the limit (that is, as the subdivision level approaches infinity), the efficiency approaches 50%.
- A second approach to graphical design is to directly support basic graphical primitives so that internal row vertices need not be repeated. This creates a mesh, such as a rectangular mesh. A rectangular mesh is generally defined as a rectangular aggregation of graphics primitives, wherein the rectangular aggregation of graphics primitives did not occur due to the two-dimensional aggregation of a plurality of triangle strips.
- In one known approach of creating a rectangular mesh, the renderer caches both the previous row of vertices of a given row of aggregated triangle-shaped or quadrilateral-shaped primitives. Then, instead of receiving both rows of vertices for the next row of aggregated triangle-shaped or quadrilateral-shaped primitives, the renderer only receives the top row of vertices for the next row of aggregated triangle-shaped or quadrilateral-shaped primitives, thereby reducing the transmitted information needed to draw the rectangular mesh and increasing efficiency. Rendering a rectangular mesh can be more efficient than rendering a rectangular lattice created by the aggregation of primitive strips.
- However, processor performance has outpaced memory and bus performance, while at he same time, the employment of subdivision surfaces has increased the demand for higher throughput. Therefore, there is a need for employing graphics primitives for rendering a subdivided triangle that overcomes the shortcomings of existing approaches.
- The present invention employs video information associated with a triangular mesh. The present invention derives a plurality of adjacent triangle-shaped primitives of a first row. Each triangle-shaped primitive is defined as having both at least one lower vertex and at least one upper vertex. At least one lower vertex and at least one upper vertex of a selected triangular primitive of the first row are cached. At least one lower vertex of the selected triangle primitive is overwritten with at least one upper vertex of the selected triangular primitive. One or more new upper vertexes of a selected triangle primitive of the next row are cached, thereby generating a triangular mesh.
- For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following Detailed Description, taken in conjunction with the accompanying drawings, in which:
-
FIG. 1A illustrates a 3-dimensional shape having a triangular mesh, wherein the triangular mesh is further subdivided into triangular graphics primitives; -
FIG. 1B illustrates a more-detailed triangular mesh, wherein the triangular mesh has been further subdivided into triangular graphics primitives; -
FIG. 2 illustrates a method for employing and rendering display information associated with a triangular mesh; and -
FIG. 3 illustrates a “C” pseudo-code subroutine, drawTriangualarMesh( ), employable for the rendering of a triangular mesh by a video device. - In the following discussion, numerous specific details are set forth to provide a thorough understanding of the present invention. However, those skilled in the art will appreciate that the present invention may be practiced without such specific details. In other instances, well-known elements have been illustrated in schematic or block diagram form in order not to obscure the present invention in unnecessary detail. Additionally, for the most part, details concerning network communications, electro-magnetic signaling techniques, and the like, have been omitted inasmuch as such details are not considered necessary to obtain a complete understanding of the present invention, and are considered to be within the understanding of persons of ordinary skill in the relevant art.
- It is further noted that, unless indicated otherwise, all functions described herein may be performed in either hardware or software, or some combination thereof. In a preferred embodiment, however, the functions are performed by a processor, such as a computer or an electronic data processor, in accordance with code, such as computer program code, software, and/or integrated circuits that are coded to perform such functions, unless indicated otherwise. In a further preferred embodiment, the computer program is embodied upon or within a computer program product, such as a floppy disk or compact disk, or other storage medium.
- Referring to
FIG. 1A , illustrated is an exemplary 3-dimensional shape, anoctahedron 100, subdivided into atriangular shape 105, wherein the triangular shape is one triangle base of theoctahedron 100. Theoctahedron 100 is further subdivided intotriangular meshes 150. Thetriangular mesh 150 is subdivided intotriangle primitives 155. Therefore, thetriangular shape 105 also comprises atriangular mesh 150. Each triangle primitive 155 has its own unique set of defined vertices, although a vertex element of a unique set of defined vertices can be shared with another triangle primitive 155. - Generally, the subdivisions of
triangular shape 105 occur to more effectively enable the creation or generation (that is, the mathematical calculation) and more accurate rendition (that is, the final display) of a given shape, such as a triangular shape. One subdivision unit of utility is the triangle primitive. In other words, a given shape, such astriangular shape 105, is ultimately subdivided into constituent elements, such astriangle primitives 155. The ultimate subdivision oftriangular shape 105 intotriangle primitives 155 is a technique of great utility in graphics systems. - In
FIG. 1A , thetriangle primitives 155 oftriangular shape 105 are defined in relation to one another to comprise thetriangular mesh 150. Generally, inFIG. 1A , eachtriangular mesh 150 is a result of both a subdivision of thetriangular shape 105 and the further subdivision of this subdivision intotriangle primitives 155. Therefore, thetriangular shape 105 is also a triangular mesh, as it comprisestriangle primitives 155 and triangular meshes 150. - The
triangular shape 105, with its constituent unique vertices of thevarious triangle primitives 155, is typically generated in a microchip or some other graphics calculation device. Any unique vertices are then transmitted to a video display device for rendering. Unique vertices of thetriangle primitives 155 are generally defined as vertices derived for the purpose of rendering graphical primitives, but these vertices are not duplicated during transmission. The unique vertices are received by the video display device and employed in the rendering of thetriangular mesh 150. - In one embodiment, rendering the
triangular mesh 150 on the display device is performed through the transmission of the bottom row of vertices, then the transmission of the upper row of vertices of a triangular strip. Triangle primitives are not rendered until the top vertices are received. In another embodiment, the rendering of thetriangular mesh 150 is generally accomplished through transmitting both the top and bottom vertices of the first row of triangle graphics primitives 155. These transmittances can occur from the graphics calculator or processor and then storing the vertices in a local storage center, such as a vertex cache of the video device. The video device renders the first row ofadjacent triangle primitives 155. The video buffer then overwrites the cached unique lower vertices of the first row ofgraphical primitives 155 with the values of the cached unique upper vertices of the first row ofgraphical primitives 155. This creates a new unique set of lower vertices employable for rendering the next row ofgraphical primitives 155. Employing overwriting avoids the necessity of a substantial duplication of transmission of the vertices in common between rows between the graphics calculation device and the display device. - The graphics calculation device then sends the top unique vertices of the next row of
triangle primitives 155 of thetriangular mesh 150 to the video device. The video display device renders a new row. The process continues until the apex of the triangular shape is reached, whereupon this last unique vertex is sent for the apex triangle primitive 155. Calculations are made to allow for the decreasing number of unique upper vertices per higher row. - Therefore, the rendered
triangular shape 105 comprises triangular meshes 150. Typically, the rendered shape does not comprise a triangular lattice. A triangular lattice is generally defined as a triangular two-dimensional aggregation of a plurality of rows of triangular strips, wherein internal vertices have been repeated during transmission. Thetriangular mesh 150 was created and rendered through the transmission and employment of unique vertices, not through the aggregation of triangle strips, thereby substantially reducing data transmission inefficiencies. -
FIG. 1B illustrates thetriangular mesh 150, wherein thetriangular mesh 150 is further subdivided and comprisestriangle primitives 155. In the illustrated embodiment, thetriangular mesh 150 comprises 16 triangle primitives. The triangle graphics primitives are illustrated as numbered from 1 to 16, and are placed in four rows. The first row comprisestriangle primitives 1 through 7, inclusive. The second row comprisestriangle primitives 8 through 12, inclusive. The third row comprisestriangle primitives 13 through 15, inclusive. Finally, the fourth row comprises triangle primitive 16. Although illustrated as comprising four rows, those skilled in the art will understand that, in a further embodiment, thetriangular mesh 150 can comprise more than four rows oftriangle primitives 155. - Within each row, the base of a first triangle primitive 155 and the last triangle primitive 155 within the selected row is oriented to the bottom of the
triangular mesh 150. The remaining triangle primitives alternate in orientation. In other words, contiguous to the triangle primitive “1”, the apex of which is oriented to the top of thetriangular mesh 150, there is a triangle primitive “2”, the apex of which is oriented to the base of thetriangular mesh 150, and so on. This alternation continues until the last triangle primitive is reached per row, wherein the apex of the last triangle primitive is oriented to the apex of thetriangular mesh 150. - The triangle primitives “1” through “7” of
row 1 have vertices associated with them. Triangle primitive “1” ofrow 1 is defined by the bottom vertices “1” and “2” and the top vertex “6.” Triangle primitive “2” ofrow 1 is defined by the bottom vertex “2” and the top vertices “6” and “7”. Triangle primitive “3” ofrow 1 is defined by the bottom vertices “2” and “3” and the top vertex “7”, and so on. - In the
triangular mesh 150, the top vertices of the triangle graphics primitives ofrow 1 are defined as the bottom vertices of the triangle vertices ofrow 2. For instance, vertex “6”, the top vertex of triangle primitive “1” ofrow 1, and vertex “7”, the top vertex of triangle primitive “2” ofrow 1, are defined as the bottom vertices of triangle primitive “8” inrow 2. Vertex “7”, the top vertex of triangle primitive “3” ofrow 1, and vertex “8”, the top vertex of triangle primitive “5” ofrow 1, are defined as the bottom vertices of triangle primitive “10” inrow 2. Vertex “7”, the top vertex of triangle primitive “3” ofrow 1, is also defined as the bottom vertex of triangle primitive “9” inrow 2. The redefining of the top vertices of a prior row as the bottom vertices of a consecutive row is continued until defining the upper vertex of the triangle primitive of the final row. In the illustrated embodiment, this is triangle primitive “16”. - Within the
triangular mesh 150, the lower vertices of each triangle primitive of a higher-order row (for example, row 3) are defined as a function of the upper vertices of the triangle primitives of a lower-order row (for example, row 2). Therefore, thetriangular mesh 150 can be rendered with the transmission of only unique vertices. Employment of only unique vertices to construct a triangular mesh requires a transmission of a lesser number of vertices than is required to construct a triangular lattice, of the same shape and size, from the vertical aggregation of a plurality of triangle strips. - Rendering a triangular lattice, constructed of a plurality of triangle strips, requires non-unique vertices. This is because each row of the aggregated triangle strips, which creates the triangular lattice, is defined independently from a consecutive triangle strip in the triangular lattice, therefore requiring more vertices to be independently defined than in a triangular mesh.
- A comparison of efficiencies between
triangular meshes 150 and a triangular lattice is demonstrated in the following table. The “level” is generally defined as the number of bisections performed, that is level “0” is a unitary triangle, level “1” is a bisected triangle, level “2” is a bisected triangle wherein each bisection has been further bisected, and so on. The “alternate level” is generally defined as a triangle that has been subdivided into a given number of equal subdivisions. In other words, an alternate level of 0 represents a unitary triangle, an alternate level of 1 represents a subdivided bisected triangle, an alternate level of 2 represents a subdivided trisected triangle, and so on. In other words, alternate levels comprise subdividing a triangle to the nth division (“n-sectioning), such as a bisection, a trisection, and so on. - “Unique mesh vertices” are generally defined as the number of vertices required to construct a subdivided triangular mesh, “triangle strip vertices” are generally defined as the number of vertices required to construct a subdivided triangle lattice from triangle strips. “Efficiency” is a comparison of the efficiency of employing triangle strip vertices for constructing a triangular shape to employing the unique vertices of a triangular mesh to create a triangular shape.
Alternate Unique Triangle Level Level Mesh Vert. Strip Vert. Efficiency 0 0 3 3 100% 1 1 6 8 67% 2 3 15 24 62% 3 7 45 80 56% 4 15 153 288 53 % n 2n−1 1 + 2(2*n−1) + 4n + Asymptotically 3*2(n−1) 2(n+1) approaches 50% - Therefore, it is typically more efficient to render a triangular shape from unique vertices, thereby creating a triangular mesh, than from strip vertices, thereby creating a triangular lattice.
- Turning now to
FIG. 2 , illustrated is a method 200 for creating and rendering thetriangular mesh 150. Generally, the method 200 calculates the vertices of the graphics primitives that represent subdivisions of atriangular shape 105. In method 200, the subdivisions comprise triangle primitives. Then, the method 200 transmits unique vertices to the video device. The video device renders the triangle graphics primitives as thetriangular mesh 150. - In
step 210, the graphics processor calculates and derives the unique vertex coordinates for the subdividedtriangular area 105. Thetriangular area 105 is then subdivided into triangle graphics primitives, creating atriangular mesh 150. In one embodiment, the subdividing comprises a bisection. As will be understood by those of skill in the art, other subdivision sub-secting schemes are within the scope of the present invention. - In
step 220, the graphics processor transmits the plurality of unique vertices for a selected row to the video display. If the unique vertices to be transmitted contain the lower vertices of the bottom row, both the upper and lower vertices of the first row are transmitted, wherein first all of the lower vertices are transmitted, then all of the upper vertices are transmitted. If the vertices to be transmitted do not contain the lower vertices of the bottom row, only the upper vertices are transmitted for the row. - In
step 230, the video device caches the values of the vertices of the triangle primitives as derived instep 210 and transmitted instep 220, wherein first all of the lower vertices are transmitted, then all of the upper vertices are transmitted. If the vertices to be transmitted contain the lower vertices of the bottom row, both the upper and lower vertices are cached in thestep 230. If the received vertices do not contain the lower vertices of the bottom row, only the upper vertices for the row are transmitted instep 220 and received and cached instep 230. - In
step 240, the video device renders the triangle primitive orprimitives 155. In one embodiment, the rendering process is performed by the video device further comprises the steps of lighting, shading, and texture/displacement mapping the triangle primitive 155. - In
step 250, if the rendering graphical object is finished, that is, if the apex vertex of the apex triangle primitive has been received, then stopstep 275 is executed. In other words, thetriangular mesh 150 has been rendered. If the apex vertex of the apex triangle primitive has not yet been received,step 260 is executed. - In
step 260, the video display overwrites the values of the lower vertices of the newly transmitted row with the values of the higher vertices of the previously transmitted row. Therefore, the higher vertices of the previous row become the lower vertices of the next row. Instep 270, the next row to be transmitted is incremented (for example, fromrow 2 to row 3). Instep 220, the graphics processor transmits the higher vertices of this new row, and so on. - Turning briefly to
FIG. 3 , disclosed is a “C” pseudo-code subroutine drawTriangularMesh( ) for rendering thetriangular mesh 150 by the video device. Generally, the MAX_MESH_WIDTH variable equals the maximum number of vertices in the bottom row of the subdivided triangle, such as thetriangular mesh 150. InFIG. 3 , MAX_MESH_WIDTH is the maximum allowable “width” parameter. - Generally, renderTriangle( ) is called to render 0, 1, or 2 triangle primitives for each vertex received. Zero triangle primitives are rendered for the first (“width”) row of vertices. One triangle primitive is rendered for the first vertex of each row. Two triangle primitives are rendered for each subsequent vertex. The subroutine renderTriangle( ) also renders the triangle primitive in a higher row. This continues until the very highest row, which comprises only a single triangle primitive. Those skilled in the art understand the use and applications of “C” pseudo-codes, and therefore the C pseudo-code will not be described in more detail.
- It is understood that the present invention can take many forms and embodiments. Accordingly, several variations may be made in the foregoing without departing from the spirit or the scope of the invention.
- Having thus described the present invention by reference to certain of its preferred embodiments, it is noted that the embodiments disclosed are illustrative rather than limiting in nature and that a wide range of variations, modifications, changes, and substitutions are contemplated in the foregoing disclosure and, in some instances, some features of the present invention may be employed without a corresponding use of the other features. Many such variations and modifications may be considered obvious and desirable by those skilled in the art based upon a review of the foregoing description of preferred embodiments. Accordingly, it is appropriate that the appended claims be construed broadly and in a manner consistent with the scope of the invention.
Claims (9)
1. An apparatus for transmitting and rendering a triangular mesh comprising a plurality of graphics triangle primitives, the graphics triangle primitives having at least one lower and upper vertex, comprising:
a graphics processor, wherein the graphics processor is employable to derive a plurality of adjacent graphics triangle primitives; and
a display device employable to cache both the at least one lower vertex and at least one upper vertex of each triangle primitive, wherein the display device is further employable to overwrite at least one lower vertex of each graphics triangle primitive with at least one higher vertex of each triangle primitive, the display device still further employable to cache at least one new upper vertex of a triangle primitive of the next higher row.
2. The apparatus of claim 1 , wherein the graphics processor is employable to subdivide a triangular shape from triangle primitives, thereby creating a triangular mesh.
3. The apparatus of claim 2 , wherein the step of subdividing comprises creating a substantially equalized bisection.
4. The apparatus of claim 2 , wherein the step of subdividing comprises creating a substantially equalized n-section.
5. A method for employing protocol for the transmission and rendering of a triangular mesh, comprising:
a first rendering of one triangle primitive upon receipt of an upper vertex of a row, wherein the vertex of the row is not the last vertex of the row;
a second rendering of two triangle primitives upon receipt of the last upper vertex of a row; and
decrementing a mesh width after a row of vertices is received.
6. The method of claim 5 , wherein the step of first rendering employs triangle primitives extendable to create a triangular mesh.
7. The method of claim 5 , wherein a step of a subdividing decomposes a shape to be transmitted and rendered into subdivisions.
8. The method of claim 7 , wherein the step of subdividing comprises creating a substantially equalized bisection.
9. The method of claim 7 , wherein the subdividing comprises creating a substantially equalized n-section.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/548,242 US20070188487A1 (en) | 2002-09-12 | 2006-10-10 | Efficient triangular shaped meshes |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/242,523 US7209137B2 (en) | 2002-09-12 | 2002-09-12 | Efficient triangular shaped meshes |
US11/548,242 US20070188487A1 (en) | 2002-09-12 | 2006-10-10 | Efficient triangular shaped meshes |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/242,523 Division US7209137B2 (en) | 2002-09-12 | 2002-09-12 | Efficient triangular shaped meshes |
Publications (1)
Publication Number | Publication Date |
---|---|
US20070188487A1 true US20070188487A1 (en) | 2007-08-16 |
Family
ID=31991429
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/242,523 Expired - Lifetime US7209137B2 (en) | 2002-09-12 | 2002-09-12 | Efficient triangular shaped meshes |
US11/548,242 Abandoned US20070188487A1 (en) | 2002-09-12 | 2006-10-10 | Efficient triangular shaped meshes |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/242,523 Expired - Lifetime US7209137B2 (en) | 2002-09-12 | 2002-09-12 | Efficient triangular shaped meshes |
Country Status (2)
Country | Link |
---|---|
US (2) | US7209137B2 (en) |
JP (1) | JP4009235B2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120200569A1 (en) * | 2011-02-07 | 2012-08-09 | Munkberg Carl J | Micropolygon Splatting |
Families Citing this family (135)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1466261B1 (en) | 2002-01-08 | 2018-03-07 | Seven Networks, LLC | Connection architecture for a mobile network |
US7917468B2 (en) | 2005-08-01 | 2011-03-29 | Seven Networks, Inc. | Linking of personal information management data |
US7853563B2 (en) | 2005-08-01 | 2010-12-14 | Seven Networks, Inc. | Universal data aggregation |
US8468126B2 (en) | 2005-08-01 | 2013-06-18 | Seven Networks, Inc. | Publishing data in an information community |
JP2004272590A (en) * | 2003-03-07 | 2004-09-30 | Sony Corp | Data encoder, data encoding method and computer program |
US7441271B2 (en) | 2004-10-20 | 2008-10-21 | Seven Networks | Method and apparatus for intercepting events in a communication system |
US8010082B2 (en) | 2004-10-20 | 2011-08-30 | Seven Networks, Inc. | Flexible billing architecture |
US7706781B2 (en) | 2004-11-22 | 2010-04-27 | Seven Networks International Oy | Data security in a mobile e-mail service |
FI117152B (en) | 2004-12-03 | 2006-06-30 | Seven Networks Internat Oy | E-mail service provisioning method for mobile terminal, involves using domain part and further parameters to generate new parameter set in list of setting parameter sets, if provisioning of e-mail service is successful |
US7877703B1 (en) | 2005-03-14 | 2011-01-25 | Seven Networks, Inc. | Intelligent rendering of information in a limited display environment |
US7796742B1 (en) | 2005-04-21 | 2010-09-14 | Seven Networks, Inc. | Systems and methods for simplified provisioning |
US8438633B1 (en) | 2005-04-21 | 2013-05-07 | Seven Networks, Inc. | Flexible real-time inbox access |
WO2006136660A1 (en) | 2005-06-21 | 2006-12-28 | Seven Networks International Oy | Maintaining an ip connection in a mobile network |
US8069166B2 (en) | 2005-08-01 | 2011-11-29 | Seven Networks, Inc. | Managing user-to-user contact with inferred presence information |
US7769395B2 (en) * | 2006-06-20 | 2010-08-03 | Seven Networks, Inc. | Location-based operations and messaging |
US20080001717A1 (en) * | 2006-06-20 | 2008-01-03 | Trevor Fiatal | System and method for group management |
WO2008053597A1 (en) * | 2006-11-01 | 2008-05-08 | Digital Media Professionals Inc. | Device for accelerating the processing of extended primitive vertex cache |
US7870313B2 (en) * | 2007-02-27 | 2011-01-11 | Integrated Device Technology, Inc. | Method and structure to support system resource access of a serial device implementating a lite-weight protocol |
US8094677B2 (en) * | 2007-02-27 | 2012-01-10 | Integrated Device Technology, Inc. | Multi-bus structure for optimizing system performance of a serial buffer |
US8693494B2 (en) | 2007-06-01 | 2014-04-08 | Seven Networks, Inc. | Polling |
US8805425B2 (en) | 2007-06-01 | 2014-08-12 | Seven Networks, Inc. | Integrated messaging |
US8127235B2 (en) | 2007-11-30 | 2012-02-28 | International Business Machines Corporation | Automatic increasing of capacity of a virtual space in a virtual world |
US8364181B2 (en) | 2007-12-10 | 2013-01-29 | Seven Networks, Inc. | Electronic-mail filtering for mobile devices |
US8793305B2 (en) | 2007-12-13 | 2014-07-29 | Seven Networks, Inc. | Content delivery to a mobile device from a content service |
US9002828B2 (en) | 2007-12-13 | 2015-04-07 | Seven Networks, Inc. | Predictive content delivery |
US20090164919A1 (en) | 2007-12-24 | 2009-06-25 | Cary Lee Bates | Generating data for managing encounters in a virtual world environment |
US8107921B2 (en) | 2008-01-11 | 2012-01-31 | Seven Networks, Inc. | Mobile virtual network operator |
US8862657B2 (en) | 2008-01-25 | 2014-10-14 | Seven Networks, Inc. | Policy based content service |
US20090193338A1 (en) | 2008-01-28 | 2009-07-30 | Trevor Fiatal | Reducing network and battery consumption during content delivery and playback |
JP5159375B2 (en) | 2008-03-07 | 2013-03-06 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Object authenticity determination system and method in metaverse, and computer program thereof |
US8787947B2 (en) | 2008-06-18 | 2014-07-22 | Seven Networks, Inc. | Application discovery on mobile devices |
US8078158B2 (en) | 2008-06-26 | 2011-12-13 | Seven Networks, Inc. | Provisioning applications for a mobile device |
US8909759B2 (en) | 2008-10-10 | 2014-12-09 | Seven Networks, Inc. | Bandwidth measurement |
US9205328B2 (en) | 2010-02-18 | 2015-12-08 | Activision Publishing, Inc. | Videogame system and method that enables characters to earn virtual fans by completing secondary objectives |
US9043731B2 (en) | 2010-03-30 | 2015-05-26 | Seven Networks, Inc. | 3D mobile user interface with configurable workspace management |
US9682324B2 (en) | 2010-05-12 | 2017-06-20 | Activision Publishing, Inc. | System and method for enabling players to participate in asynchronous, competitive challenges |
EP2599003B1 (en) | 2010-07-26 | 2018-07-11 | Seven Networks, LLC | Mobile network traffic coordination across multiple applications |
US8838783B2 (en) | 2010-07-26 | 2014-09-16 | Seven Networks, Inc. | Distributed caching for resource and mobile network traffic management |
EP2599345B1 (en) | 2010-07-26 | 2017-09-06 | Seven Networks, LLC | Distributed implementation of dynamic wireless traffic policy |
WO2012018556A2 (en) | 2010-07-26 | 2012-02-09 | Ari Backholm | Mobile application traffic optimization |
US8204953B2 (en) | 2010-11-01 | 2012-06-19 | Seven Networks, Inc. | Distributed system for cache defeat detection and caching of content addressed by identifiers intended to defeat cache |
WO2012061430A2 (en) | 2010-11-01 | 2012-05-10 | Michael Luna | Distributed management of keep-alive message signaling for mobile network resource conservation and optimization |
US9330196B2 (en) | 2010-11-01 | 2016-05-03 | Seven Networks, Llc | Wireless traffic management system cache optimization using http headers |
CN103620576B (en) | 2010-11-01 | 2016-11-09 | 七网络公司 | It is applicable to the caching of mobile applications behavior and network condition |
US8484314B2 (en) | 2010-11-01 | 2013-07-09 | Seven Networks, Inc. | Distributed caching in a wireless network of content delivered for a mobile application over a long-held request |
US8417823B2 (en) | 2010-11-22 | 2013-04-09 | Seven Network, Inc. | Aligning data transfer to optimize connections established for transmission over a wireless network |
WO2012060997A2 (en) | 2010-11-01 | 2012-05-10 | Michael Luna | Application and network-based long poll request detection and cacheability assessment therefor |
WO2012060995A2 (en) | 2010-11-01 | 2012-05-10 | Michael Luna | Distributed caching in a wireless network of content delivered for a mobile application over a long-held request |
US8843153B2 (en) | 2010-11-01 | 2014-09-23 | Seven Networks, Inc. | Mobile traffic categorization and policy for network use optimization while preserving user experience |
US9060032B2 (en) | 2010-11-01 | 2015-06-16 | Seven Networks, Inc. | Selective data compression by a distributed traffic management system to reduce mobile data traffic and signaling traffic |
GB2500327B (en) | 2010-11-22 | 2019-11-06 | Seven Networks Llc | Optimization of resource polling intervals to satisfy mobile device requests |
EP2661697B1 (en) | 2011-01-07 | 2018-11-21 | Seven Networks, LLC | System and method for reduction of mobile network traffic used for domain name system (dns) queries |
US8316098B2 (en) | 2011-04-19 | 2012-11-20 | Seven Networks Inc. | Social caching for device resource sharing and management |
GB2504037B (en) | 2011-04-27 | 2014-12-24 | Seven Networks Inc | Mobile device which offloads requests made by a mobile application to a remote entity for conservation of mobile device and network resources |
US8621075B2 (en) | 2011-04-27 | 2013-12-31 | Seven Metworks, Inc. | Detecting and preserving state for satisfying application requests in a distributed proxy and cache system |
EP2737741A4 (en) | 2011-07-27 | 2015-01-21 | Seven Networks Inc | Monitoring mobile application activities for malicious traffic on a mobile device |
US8918503B2 (en) | 2011-12-06 | 2014-12-23 | Seven Networks, Inc. | Optimization of mobile traffic directed to private networks and operator configurability thereof |
EP2789138B1 (en) | 2011-12-06 | 2016-09-14 | Seven Networks, LLC | A mobile device and method to utilize the failover mechanisms for fault tolerance provided for mobile traffic management and network/device resource conservation |
EP2788889A4 (en) | 2011-12-07 | 2015-08-12 | Seven Networks Inc | Flexible and dynamic integration schemas of a traffic management system with various network operators for network traffic alleviation |
US9277443B2 (en) | 2011-12-07 | 2016-03-01 | Seven Networks, Llc | Radio-awareness of mobile device for sending server-side control signals using a wireless network optimized transport protocol |
US20130159511A1 (en) | 2011-12-14 | 2013-06-20 | Seven Networks, Inc. | System and method for generating a report to a network operator by distributing aggregation of data |
US9832095B2 (en) | 2011-12-14 | 2017-11-28 | Seven Networks, Llc | Operation modes for mobile traffic optimization and concurrent management of optimized and non-optimized traffic |
WO2013090821A1 (en) | 2011-12-14 | 2013-06-20 | Seven Networks, Inc. | Hierarchies and categories for management and deployment of policies for distributed wireless traffic optimization |
GB2499306B (en) | 2012-01-05 | 2014-10-22 | Seven Networks Inc | Managing user interaction with an application on a mobile device |
WO2013116856A1 (en) | 2012-02-02 | 2013-08-08 | Seven Networks, Inc. | Dynamic categorization of applications for network access in a mobile network |
WO2013116852A1 (en) | 2012-02-03 | 2013-08-08 | Seven Networks, Inc. | User as an end point for profiling and optimizing the delivery of content and data in a wireless network |
US8812695B2 (en) | 2012-04-09 | 2014-08-19 | Seven Networks, Inc. | Method and system for management of a virtual network connection without heartbeat messages |
US20130268656A1 (en) | 2012-04-10 | 2013-10-10 | Seven Networks, Inc. | Intelligent customer service/call center services enhanced using real-time and historical mobile application and traffic-related statistics collected by a distributed caching system in a mobile network |
WO2014011216A1 (en) | 2012-07-13 | 2014-01-16 | Seven Networks, Inc. | Dynamic bandwidth adjustment for browsing or streaming activity in a wireless network based on prediction of user behavior when interacting with mobile applications |
US8938796B2 (en) | 2012-09-20 | 2015-01-20 | Paul Case, SR. | Case secure computer architecture |
US9161258B2 (en) | 2012-10-24 | 2015-10-13 | Seven Networks, Llc | Optimized and selective management of policy deployment to mobile clients in a congested network to prevent further aggravation of network congestion |
US9305397B2 (en) | 2012-10-24 | 2016-04-05 | Qualcomm Incorporated | Vertex order in a tessellation unit |
US9307493B2 (en) | 2012-12-20 | 2016-04-05 | Seven Networks, Llc | Systems and methods for application management of mobile device radio state promotion and demotion |
US10137376B2 (en) | 2012-12-31 | 2018-11-27 | Activision Publishing, Inc. | System and method for creating and streaming augmented game sessions |
US9241314B2 (en) | 2013-01-23 | 2016-01-19 | Seven Networks, Llc | Mobile device with application or context aware fast dormancy |
US8874761B2 (en) | 2013-01-25 | 2014-10-28 | Seven Networks, Inc. | Signaling optimization in a wireless network for traffic utilizing proprietary and non-proprietary protocols |
US8750123B1 (en) | 2013-03-11 | 2014-06-10 | Seven Networks, Inc. | Mobile device equipped with mobile network congestion recognition to make intelligent decisions regarding connecting to an operator network |
US9065765B2 (en) | 2013-07-22 | 2015-06-23 | Seven Networks, Inc. | Proxy server associated with a mobile carrier for enhancing mobile traffic management in a mobile network |
JP6375683B2 (en) * | 2014-05-01 | 2018-08-22 | ヤマハ株式会社 | Image processing device |
US10286326B2 (en) | 2014-07-03 | 2019-05-14 | Activision Publishing, Inc. | Soft reservation system and method for multiplayer video games |
US11351466B2 (en) | 2014-12-05 | 2022-06-07 | Activision Publishing, Ing. | System and method for customizing a replay of one or more game events in a video game |
US10118099B2 (en) | 2014-12-16 | 2018-11-06 | Activision Publishing, Inc. | System and method for transparently styling non-player characters in a multiplayer video game |
US10315113B2 (en) | 2015-05-14 | 2019-06-11 | Activision Publishing, Inc. | System and method for simulating gameplay of nonplayer characters distributed across networked end user devices |
US10286314B2 (en) | 2015-05-14 | 2019-05-14 | Activision Publishing, Inc. | System and method for providing continuous gameplay in a multiplayer video game through an unbounded gameplay session |
US10486068B2 (en) | 2015-05-14 | 2019-11-26 | Activision Publishing, Inc. | System and method for providing dynamically variable maps in a video game |
US10668367B2 (en) | 2015-06-15 | 2020-06-02 | Activision Publishing, Inc. | System and method for uniquely identifying physical trading cards and incorporating trading card game items in a video game |
US10471348B2 (en) | 2015-07-24 | 2019-11-12 | Activision Publishing, Inc. | System and method for creating and sharing customized video game weapon configurations in multiplayer video games via one or more social networks |
US10099140B2 (en) | 2015-10-08 | 2018-10-16 | Activision Publishing, Inc. | System and method for generating personalized messaging campaigns for video game players |
US11185784B2 (en) | 2015-10-08 | 2021-11-30 | Activision Publishing, Inc. | System and method for generating personalized messaging campaigns for video game players |
US10376781B2 (en) | 2015-10-21 | 2019-08-13 | Activision Publishing, Inc. | System and method of generating and distributing video game streams |
US10245509B2 (en) | 2015-10-21 | 2019-04-02 | Activision Publishing, Inc. | System and method of inferring user interest in different aspects of video game streams |
US10232272B2 (en) | 2015-10-21 | 2019-03-19 | Activision Publishing, Inc. | System and method for replaying video game streams |
US10694352B2 (en) | 2015-10-28 | 2020-06-23 | Activision Publishing, Inc. | System and method of using physical objects to control software access |
US10300390B2 (en) | 2016-04-01 | 2019-05-28 | Activision Publishing, Inc. | System and method of automatically annotating gameplay of a video game based on triggering events |
US10226701B2 (en) | 2016-04-29 | 2019-03-12 | Activision Publishing, Inc. | System and method for identifying spawn locations in a video game |
US10179289B2 (en) | 2016-06-21 | 2019-01-15 | Activision Publishing, Inc. | System and method for reading graphically-encoded identifiers from physical trading cards through image-based template matching |
US10109105B2 (en) * | 2016-07-12 | 2018-10-23 | Nature Simulation Systems Inc. | Method for immediate boolean operations using geometric facets |
US10120961B2 (en) * | 2016-07-12 | 2018-11-06 | Nature Simulation Systems Inc. | Method for immediate boolean operations using geometric facets |
US10573065B2 (en) | 2016-07-29 | 2020-02-25 | Activision Publishing, Inc. | Systems and methods for automating the personalization of blendshape rigs based on performance capture data |
US10463964B2 (en) | 2016-11-17 | 2019-11-05 | Activision Publishing, Inc. | Systems and methods for the real-time generation of in-game, locally accessible heatmaps |
US10709981B2 (en) | 2016-11-17 | 2020-07-14 | Activision Publishing, Inc. | Systems and methods for the real-time generation of in-game, locally accessible barrier-aware heatmaps |
US10500498B2 (en) | 2016-11-29 | 2019-12-10 | Activision Publishing, Inc. | System and method for optimizing virtual games |
US10055880B2 (en) | 2016-12-06 | 2018-08-21 | Activision Publishing, Inc. | Methods and systems to modify a two dimensional facial image to increase dimensional depth and generate a facial image that appears three dimensional |
US10861079B2 (en) | 2017-02-23 | 2020-12-08 | Activision Publishing, Inc. | Flexible online pre-ordering system for media |
US10818060B2 (en) | 2017-09-05 | 2020-10-27 | Activision Publishing, Inc. | Systems and methods for guiding motion capture actors using a motion reference system |
US11040286B2 (en) | 2017-09-27 | 2021-06-22 | Activision Publishing, Inc. | Methods and systems for improved content generation in multiplayer gaming environments |
US10561945B2 (en) | 2017-09-27 | 2020-02-18 | Activision Publishing, Inc. | Methods and systems for incentivizing team cooperation in multiplayer gaming environments |
US10974150B2 (en) | 2017-09-27 | 2021-04-13 | Activision Publishing, Inc. | Methods and systems for improved content customization in multiplayer gaming environments |
US10537809B2 (en) | 2017-12-06 | 2020-01-21 | Activision Publishing, Inc. | System and method for validating video gaming data |
US10463971B2 (en) | 2017-12-06 | 2019-11-05 | Activision Publishing, Inc. | System and method for validating video gaming data |
US10981051B2 (en) | 2017-12-19 | 2021-04-20 | Activision Publishing, Inc. | Synchronized, fully programmable game controllers |
US11278813B2 (en) | 2017-12-22 | 2022-03-22 | Activision Publishing, Inc. | Systems and methods for enabling audience participation in bonus game play sessions |
US10596471B2 (en) | 2017-12-22 | 2020-03-24 | Activision Publishing, Inc. | Systems and methods for enabling audience participation in multi-player video game play sessions |
US10864443B2 (en) | 2017-12-22 | 2020-12-15 | Activision Publishing, Inc. | Video game content aggregation, normalization, and publication systems and methods |
US11192028B2 (en) | 2018-11-19 | 2021-12-07 | Activision Publishing, Inc. | Systems and methods for the real-time customization of video game content based on player data |
US11263670B2 (en) | 2018-11-19 | 2022-03-01 | Activision Publishing, Inc. | Systems and methods for dynamically modifying video game content based on non-video gaming content being concurrently experienced by a user |
US11115712B2 (en) | 2018-12-15 | 2021-09-07 | Activision Publishing, Inc. | Systems and methods for indexing, searching for, and retrieving digital media |
US11679330B2 (en) | 2018-12-18 | 2023-06-20 | Activision Publishing, Inc. | Systems and methods for generating improved non-player characters |
US11305191B2 (en) | 2018-12-20 | 2022-04-19 | Activision Publishing, Inc. | Systems and methods for controlling camera perspectives, movements, and displays of video game gameplay |
US11344808B2 (en) | 2019-06-28 | 2022-05-31 | Activision Publishing, Inc. | Systems and methods for dynamically generating and modulating music based on gaming events, player profiles and/or player reactions |
US11097193B2 (en) | 2019-09-11 | 2021-08-24 | Activision Publishing, Inc. | Methods and systems for increasing player engagement in multiplayer gaming environments |
US11423605B2 (en) | 2019-11-01 | 2022-08-23 | Activision Publishing, Inc. | Systems and methods for remastering a game space while maintaining the underlying game simulation |
US11712627B2 (en) | 2019-11-08 | 2023-08-01 | Activision Publishing, Inc. | System and method for providing conditional access to virtual gaming items |
US11537209B2 (en) | 2019-12-17 | 2022-12-27 | Activision Publishing, Inc. | Systems and methods for guiding actors using a motion capture reference system |
US11420122B2 (en) | 2019-12-23 | 2022-08-23 | Activision Publishing, Inc. | Systems and methods for controlling camera perspectives, movements, and displays of video game gameplay |
US11563774B2 (en) | 2019-12-27 | 2023-01-24 | Activision Publishing, Inc. | Systems and methods for tracking and identifying phishing website authors |
US11524234B2 (en) | 2020-08-18 | 2022-12-13 | Activision Publishing, Inc. | Multiplayer video games with virtual characters having dynamically modified fields of view |
US11351459B2 (en) | 2020-08-18 | 2022-06-07 | Activision Publishing, Inc. | Multiplayer video games with virtual characters having dynamically generated attribute profiles unconstrained by predefined discrete values |
US11724188B2 (en) | 2020-09-29 | 2023-08-15 | Activision Publishing, Inc. | Methods and systems for selecting a level of detail visual asset during the execution of a video game |
US11833423B2 (en) | 2020-09-29 | 2023-12-05 | Activision Publishing, Inc. | Methods and systems for generating level of detail visual assets in a video game |
US11717753B2 (en) | 2020-09-29 | 2023-08-08 | Activision Publishing, Inc. | Methods and systems for generating modified level of detail visual assets in a video game |
US11439904B2 (en) | 2020-11-11 | 2022-09-13 | Activision Publishing, Inc. | Systems and methods for imparting dynamic and realistic movement to player-controlled avatars in video games |
US11794107B2 (en) | 2020-12-30 | 2023-10-24 | Activision Publishing, Inc. | Systems and methods for improved collision detection in video games |
US11853439B2 (en) | 2020-12-30 | 2023-12-26 | Activision Publishing, Inc. | Distributed data storage system providing enhanced security |
CN115659443B (en) * | 2022-12-29 | 2023-06-27 | 摩尔线程智能科技(北京)有限责任公司 | Geometry stream data processing method and device, computing device and storage medium |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5841443A (en) * | 1997-02-20 | 1998-11-24 | S3 Incorporated | Method for triangle subdivision in computer graphics texture mapping to eliminate artifacts in high perspective polygons |
US6016153A (en) * | 1996-07-30 | 2000-01-18 | International Business Machines Corporation | Method to convert non-manifold polyhedral surfaces into manifold surfaces |
US6028607A (en) * | 1998-01-15 | 2000-02-22 | Sun Microsystems, Inc. | Method of producing a sequence of triangles from a vertex raster with and without half resolution edges while decompressing a compressed geometry stream |
US6031548A (en) * | 1997-06-13 | 2000-02-29 | International Business Machines Corporation | Progressive multi-level transmission and display of triangular meshes |
US6078331A (en) * | 1996-09-30 | 2000-06-20 | Silicon Graphics, Inc. | Method and system for efficiently drawing subdivision surfaces for 3D graphics |
US6130673A (en) * | 1997-04-18 | 2000-10-10 | Silicon Graphics, Inc. | Editing a surface |
US6137492A (en) * | 1997-04-03 | 2000-10-24 | Microsoft Corporation | Method and system for adaptive refinement of progressive meshes |
US6144773A (en) * | 1996-02-27 | 2000-11-07 | Interval Research Corporation | Wavelet-based data compression |
US6184908B1 (en) * | 1998-04-27 | 2001-02-06 | Ati Technologies, Inc. | Method and apparatus for co-processing video graphics data |
US20010013866A1 (en) * | 1999-01-27 | 2001-08-16 | Alexander Migdal | Adaptive subdivision of mesh models |
US6307555B1 (en) * | 1998-09-30 | 2001-10-23 | Silicon Graphics, Inc. | Boolean operations for subdivision surfaces |
US20010033281A1 (en) * | 2000-03-06 | 2001-10-25 | Yasuhiko Yoshida | Three-dimensional CAD system and recording medium for three-dimensional CAD system |
US6525722B1 (en) * | 1995-08-04 | 2003-02-25 | Sun Microsystems, Inc. | Geometry compression for regular and irregular mesh structures |
US6559842B1 (en) * | 1999-06-14 | 2003-05-06 | Sun Microsystems, Inc. | Compressing and decompressing graphics data using gosub-type instructions and direct and indirect attribute settings |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US33281A (en) * | 1861-09-10 | Improved filtering-cup | ||
US13866A (en) * | 1855-12-04 | John a | ||
US5696944A (en) * | 1995-08-08 | 1997-12-09 | Hewlett-Packard Company | Computer graphics system having double buffered vertex ram with granularity |
US6169549B1 (en) * | 1998-01-07 | 2001-01-02 | Iengineer.Com, Inc. | Method and apparatus for providing continuous level of detail |
-
2002
- 2002-09-12 US US10/242,523 patent/US7209137B2/en not_active Expired - Lifetime
-
2003
- 2003-09-04 JP JP2003313278A patent/JP4009235B2/en not_active Expired - Lifetime
-
2006
- 2006-10-10 US US11/548,242 patent/US20070188487A1/en not_active Abandoned
Patent Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6525722B1 (en) * | 1995-08-04 | 2003-02-25 | Sun Microsystems, Inc. | Geometry compression for regular and irregular mesh structures |
US6144773A (en) * | 1996-02-27 | 2000-11-07 | Interval Research Corporation | Wavelet-based data compression |
US6016153A (en) * | 1996-07-30 | 2000-01-18 | International Business Machines Corporation | Method to convert non-manifold polyhedral surfaces into manifold surfaces |
US6078331A (en) * | 1996-09-30 | 2000-06-20 | Silicon Graphics, Inc. | Method and system for efficiently drawing subdivision surfaces for 3D graphics |
US5841443A (en) * | 1997-02-20 | 1998-11-24 | S3 Incorporated | Method for triangle subdivision in computer graphics texture mapping to eliminate artifacts in high perspective polygons |
US6137492A (en) * | 1997-04-03 | 2000-10-24 | Microsoft Corporation | Method and system for adaptive refinement of progressive meshes |
US6130673A (en) * | 1997-04-18 | 2000-10-10 | Silicon Graphics, Inc. | Editing a surface |
US6031548A (en) * | 1997-06-13 | 2000-02-29 | International Business Machines Corporation | Progressive multi-level transmission and display of triangular meshes |
US6028607A (en) * | 1998-01-15 | 2000-02-22 | Sun Microsystems, Inc. | Method of producing a sequence of triangles from a vertex raster with and without half resolution edges while decompressing a compressed geometry stream |
US6184908B1 (en) * | 1998-04-27 | 2001-02-06 | Ati Technologies, Inc. | Method and apparatus for co-processing video graphics data |
US6307555B1 (en) * | 1998-09-30 | 2001-10-23 | Silicon Graphics, Inc. | Boolean operations for subdivision surfaces |
US20010013866A1 (en) * | 1999-01-27 | 2001-08-16 | Alexander Migdal | Adaptive subdivision of mesh models |
US6356263B2 (en) * | 1999-01-27 | 2002-03-12 | Viewpoint Corporation | Adaptive subdivision of mesh models |
US6559842B1 (en) * | 1999-06-14 | 2003-05-06 | Sun Microsystems, Inc. | Compressing and decompressing graphics data using gosub-type instructions and direct and indirect attribute settings |
US20010033281A1 (en) * | 2000-03-06 | 2001-10-25 | Yasuhiko Yoshida | Three-dimensional CAD system and recording medium for three-dimensional CAD system |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120200569A1 (en) * | 2011-02-07 | 2012-08-09 | Munkberg Carl J | Micropolygon Splatting |
WO2012108946A3 (en) * | 2011-02-07 | 2012-11-08 | Intel Corporation | Micropolygon splatting |
US9401046B2 (en) * | 2011-02-07 | 2016-07-26 | Intel Corporation | Micropolygon splatting |
Also Published As
Publication number | Publication date |
---|---|
US20040051715A1 (en) | 2004-03-18 |
JP4009235B2 (en) | 2007-11-14 |
US7209137B2 (en) | 2007-04-24 |
JP2004103021A (en) | 2004-04-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7209137B2 (en) | Efficient triangular shaped meshes | |
DE112012001132B4 (en) | Compression of a tessellated primitive index list in a tile-based rendering system | |
US7956860B2 (en) | Subdividing geometry images in graphics hardware | |
US6208347B1 (en) | System and method for computer modeling of 3D objects and 2D images by mesh constructions that incorporate non-spatial data such as color or texture | |
US20080170066A1 (en) | Graphic rendering method and system comprising a graphic module | |
US20020158880A1 (en) | Methods, apparatus and computer program products for modeling three-dimensional colored objects | |
EP0486173A2 (en) | Apparatus and method for displaying a trimmed surface on a computer graphics display system | |
US8933945B2 (en) | Dividing work among multiple graphics pipelines using a super-tiling technique | |
EP0549944A2 (en) | Multi-resolution graphic representation for interactive visualization applications | |
CA2370752A1 (en) | Fast rendering of pyramid lens distorted raster images | |
US5420940A (en) | CGSI pipeline performance improvement | |
CN105160705A (en) | Processing method of mobile terminal three dimensional image data based on three dimensional engine | |
US6515660B1 (en) | Apparatus and method for dynamic triangle stripping | |
JP2003346177A (en) | Radiosity geometric processing method using triangular patch | |
CN113674419B (en) | Three-dimensional display method and device for meteorological cloud data, electronic equipment and storage medium | |
Somosi et al. | A parallel algorithm for rendering huge terrain surfaces | |
Veguilla et al. | Issues in Terrain Visualization for Environmental Monitoring Applications | |
Sheng et al. | Progressive streaming of irregular meshes using geometry images | |
Wang et al. | View-dependent continuous level-of-detail rendering of terrain model | |
Rodriguez | Issues in Terrain Visualization for Environmental Monitoring Applications | |
Shinkovich | Feature preserving continuous level-of-detail for terrain rendering | |
JPS6180463A (en) | Display processing system for curved surface |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: ACTIVISION PUBLISHING, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:029900/0285 Effective date: 20121231 |