Volume rendering processing distribution in a graphics processing unit

• US 7,852,335 B2
• Filed: 09/20/2007
• Issued: 12/14/2010
• Est. Priority Date: 05/09/2005
• Status: Expired due to Fees

• Current Assignee: TomTec Imaging Systems GmbH (Koninklijke Philips N.V.), Siemens Medical Solutions USA Incorporated (Siemens AG)
• Original Assignee: TomTec Imaging Systems GmbH (Koninklijke Philips N.V.), Siemens Medical Solutions USA Incorporated (Siemens AG)
• Inventors: Sumanaweera, Thilaka S., Brabec, Stefan
• Primary Examiner(s): PAPPAS, PETER
• Application Number:
  US11/903,322
• Publication Number:
  US 20080012852A1
• Time in Patent Office: 1,181 Days
• Field of Search: None
• US Class Current: 345/423
• CPC Class Codes: G06T 15/08 Volume rendering
• CPC Class Codes: G06T 19/00 Manipulating 3D models or images for computer graphics
• CPC Class Codes: G06T 2219/008 Cut plane or projection plane definition

Abstract

An intersection of a cut plane with a proxy geometry representing a scan volume is determined with a processor. The intersection is simplified, such as identifying a quadrilateral or triangle most closely enclosing the intersection. The vertex processor of a GPU deforms a reference grid and determines Cartesian coordinates and the texture coordinates for grid points of the reference grid as a function of the input intersection. The vertex processor provides coordinates for data for subsets of cut planes. The fragment processor inputs the texture coordinates and retrieves the data from the texture memory. The data is blended. The blended subsets are then blended together in the frame buffer of the GPU.

Claims

1. A method for determining coordinate data used by a graphics processing unit, the method comprising:

identifying via a processor vertices of an intersection of a cut plane with a geometry representing a scanned volume, where the intersection is on the cut plane and the intersection is of the geometry;

if a number of the vertices is greater than four, identifying via a processor a fewer number of polygon vertices defining a single polygon completely enclosing the intersection, the polygon vertices having coordinates, the polygon being defined with fewer sides than the number, at least one of the polygon vertices having the same coordinates as a respective at least one of the vertices of the intersection;

inputting the coordinates to the graphics processing unit; and

generating, with the graphics processing unit, an image as a function of the coordinates and from data representing the scanned volume.

2. The method of claim 1 wherein identifying a fewer number comprises identifying four polygon vertices defining the polygon comprising a quadrilateral.

3. The method of claim 1 wherein identifying the vertices of the intersection comprises identifying points defining a shape of the intersection.

4. The method of claim 1 wherein the geometry comprises a substantially pyramidal shape representing the scanned volume, the scanned volume corresponding to three dimensional data obtained from scanning with ultrasound.

5. The method of claim 1 further comprising inputting a reference grid of intersecting lines in a Cartesian coordinate space to the graphics processing unit, the reference grid different than a grid on which the data representing the volume is distributed.

6. The method of claim 1 wherein identifying the fewer number comprises identifying the polygon vertices defining the polygon which has a minimal area while completely enclosing the intersection with the fewer number of polygon vertices.

7. The method of claim 1 wherein identifying the polygon vertices comprises defining the single polygon as having at least two of the sides shared with sides of the intersection.

8. A method for determining coordinate data used by a graphics processing unit, the method comprising:

identifying via a processor vertices of an intersection of a cut plane with a geometry representing a scanned volume, where the intersection is on the cut plane and the intersection is of the geometry;

if a number of the vertices is greater than four, identifying via a processor a fewer number of polygon vertices defining a polygon completely enclosing the entire intersection, the polygon vertices having coordinates and the polygon vertices corresponding to removal of one or more of the vertices of the intersection and adjustment of other vertices to account for the removal;

inputting the coordinates to the graphics processing unit; and

generating, with the graphics processing unit, an image as a function of the coordinates and from data representing the scanned volume.

9. The method of claim 8 wherein identifying comprises defining the polygon with at least one edge passing through one of the vertices of the intersection.

10. The method of claim 8 wherein identifying comprises defining the polygon with at least two corners outside the scanned volume.

11. The method of claim 8 wherein identifying comprises defining the polygon with an edge parallel to and longer than an edge of the intersection.

12. The method of claim 8 wherein identifying the fewer number comprises identifying the polygon vertices defining the polygon which has a minimal area while completely enclosing the intersection with the fewer number of polygon vertices.

13. The method of claim 8 wherein identifying the polygon vertices comprises defining the polygon as having at least two sides shared with sides of the intersection.