US2009295799A1PendingUtilityA1

Optimized Frustum Clipping Via Cached Clip Vertices

50
Individually held — no corporate assignee on recordPriority: Mar 23, 2006Filed: Aug 7, 2009Published: Dec 3, 2009
Est. expiryMar 23, 2026(expired)· nominal 20-yr term from priority
Inventors:Oliver HeimStephen Junkins
G06T 15/30
50
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Apparatus, systems and methods for optimized frustum clipping via cached clip vertices are disclosed. For example, a method is disclosed, the method including generating a clip vertex for a leading edge of a triangle of a triangle strip or fan, indicating that the leading edge is shared with an adjacent triangle of the triangle strip or fan, and in response to the indication, using the clip vertex as a clip vertex of a trailing edge of the adjacent triangle in the triangle strip or fan. Other implementations are disclosed.

Claims

exact text as granted — not AI-modified
1 . A method comprising:
 determining in a graphics processor whether a polygon intersects a view frustum;   clip processing the polygon depending on whether it intersects the view frustum;   determining whether there is an edge of the polygon that is shared with another polygon, which shared edge was clipped; and   in response to determining there was a shared leading edge that was clipped, using a shared clipped vertex as a clipped vertex of the adjacent polygon.   
   
   
       2 . The method of  claim 1 , including indicating that a leading edge is shared with an adjacent polygon by configuring at least one data bit. 
   
   
       3 . The method of  claim 2 , further comprising:
 reconfiguring the at least one data bit after using the clip vertex as a clip vertex of a trailing edge of the adjacent polygon.   
   
   
       4 . The method of  claim 2 , further comprising:
 storing the clip vertex in memory.   
   
   
       5 . The method of  claim 4 , wherein the memory includes the indicator. 
   
   
       6 . The method of  claim 4 , wherein in response to the indication, using the clip vertex as a clip vertex of a trailing edge of the adjacent polygon comprises:
 providing a pointer to a location where the clip vertex is stored.   
   
   
       7 . The method of  claim 1  including using a triangle as said polygon. 
   
   
       8 . An article comprising a machine-accessible medium having stored thereon instructions that, when executed by a machine, cause the machine to:
 determine whether a polygon intersects a view frustum;   clip process the polygon depending on whether it intersects the view frustum;   determine whether there is an edge of the polygon that is shared with another polygon, which shared edge was clipped; and   in response to determining there was a shared edge that was clipped, use a shared clipped vertex as a clipped vertex of the adjacent polygon.   
   
   
       9 . The article of  claim 8 , wherein the instructions to indicate that the leading edge is shared, when executed by a machine, cause the machine to configure an indicator. 
   
   
       10 . The article of  claim 9 , wherein the instructions to indicate that the leading edge is shared, when executed by a machine, cause the machine to set at least one data bit. 
   
   
       11 . The article of  claim 10 , further having stored thereon instructions that, when executed by a machine, cause the machine to:
 reset the at least one data bit after using the clip vertex as a clip vertex of a trailing edge of the adjacent polygon.   
   
   
       12 . The article of  claim 9 , further having stored thereon instructions that, when executed by a machine, cause the machine to:
 store the clip vertex in memory.   
   
   
       13 . The article of  claim 12 , wherein the memory includes the indicator. 
   
   
       14 . The article of  claim 12 , wherein the instructions to use the clip vertex as a clip vertex of a trailing edge of the adjacent triangle, when executed by a machine, cause the machine to:
 provide a pointer to a location where the clip vertex is stored.   
   
   
       15 . An apparatus comprising:
 memory to store an indicator of a shared edge between adjacent polygons within a view frustum; and   a processor to determine whether a polygon intersects a view frustum, clip process the polygon depending on whether it intersects the view frustum, determine whether there is an edge of the polygon that is shared with another polygon, which shared edge was clipped, in response to determining there was a shared edge that was clipped, use a shared clipped vertex as a clipped vertex of the adjacent polygon.   
   
   
       16 . The apparatus of  claim 15 , the memory to further store the clip vertex. 
   
   
       17 . The apparatus of  claim 15 , the memory to further store a pointer, the pointer indicating a location where the clip vertex is stored. 
   
   
       18 . The apparatus of  claim 15 , wherein the indicator comprises one or more data bits. 
   
   
       19 . A system comprising:
 memory to store an indicator of a shared edge between adjacent polygons within a view frustum;   a graphics processor to determine whether a polygon intersects a view frustum, clip process the polygon depending on whether it intersects the view frustum, determine whether there is an edge of the polygon that is shared with another polygon, which shared edge was clipped, and in response to determining there was a shared edge that was clipped, use a shared clipped vertex as a clipped vertex of the adjacent polygon; and   a display processor at least capable of converting image data including the clip vertex into a format suitable for driving a display.   
   
   
       20 . The system of  claim 19 , the memory to further store the clip vertex. 
   
   
       21 . The system of  claim 19 , the memory to further store a pointer, the pointer indicating a location where the clip vertex is stored.

Join the waitlist — get patent alerts

Track US2009295799A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.