Volume body renderer

• US 7,991,600 B2
• Filed: 07/18/2008
• Issued: 08/02/2011
• Est. Priority Date: 04/18/2001
• Status: Expired due to Fees

• Current Assignee: Landmark Graphics Corporation (Halliburton Company)
• Original Assignee: Landmark Graphics Corporation (Halliburton Company)
• Inventors: Callegari, Andres C.
• Primary Examiner(s): PROCTOR, JASON SCOTT
• Application Number:
  US12/176,075
• Publication Number:
  US 20080297510A1
• Time in Patent Office: 1,110 Days
• Field of Search: 345/423, 345/424, 382/109, 703/10, 703/6
• US Class Current: 703/10
• CPC Class Codes: G01V 1/30 Analysis G01V1/50 takes precedence
• CPC Class Codes: G06T 15/08 Volume rendering
• CPC Class Codes: G06T 17/05 Geographic models
• CPC Class Codes: G06T 2207/20156 Automatic seed setting
• CPC Class Codes: G06T 2207/30181 Earth observation
• CPC Class Codes: G06T 7/11 Region-based segmentation
• CPC Class Codes: G06T 7/187 involving region growing; involving region merging; involving connected component labelling
• CPC Class Codes: G06V 10/267 by performing operations on regions, e.g. growing, shrinking or watersheds
• CPC Class Codes: G06V 10/955 using specific electronic processors

Abstract

Irregular volumes within one or more three-dimensional volume datasets are identified and extracted in response to criteria. The processing involves automatically finding a seed voxel or seed cell that meets the criteria and thus belongs to an irregular volume of interest, and then identifying cells related to the seed cell by one or more predetermined relationships that are therefore also to be grouped into that irregular volume. Information, which can be of any suitable type, identifying each such cell as being related to other cells and belonging to an irregular volume is stored in a suitable data structure. The location or similar neighborhood information and other data describing properties or attributes of the identified cell are also stored. Because the irregular volumes are extracted and pre-processed in this manner, operations including rendering them on a display and performing Boolean and arithmetic operations on them can readily be performed.

Claims

1. A computer-implemented method for identifying irregular volumes represented within volumetric input data, comprising the steps of:

inputting one or more volume datasets comprising a multiplicity of three-dimensional cells;

establishing criteria describing properties of an irregular volume of interest;

processing each volume dataset, the processing comprising the steps of;

traversing from cell to cell of the volume dataset until a seed cell is identified having properties matching the criteria, the identified seed cell thereby belonging to an identified irregular volume;

identifying cells related to the seed cell by a predetermined relationship as belonging to the identified irregular volume; and

storing in a data structure associated with each identified cell belonging to the identified irregular volume, attribute data describing properties of the identified cell;

selecting an identified irregular volume;

transforming each cell of the irregular volume that is selected into a polyhedral voxel representation, representation including a face string having a plurality of bits, and a position string having a plurality of bits, each bit of the face string corresponding to one face of the polyhedral voxel and having a value indicating whether the face is to be displayed, the position string having a value indicating a three-dimensional spatial position of the polyhedral voxel; and

rendering the representation of each polyhedral voxel, the face string for at least one polyhedral voxel representation having a bit with a value indicating at least one face is to be displayed for an internal cell.

2. The method claimed in claim 1, wherein the rendering step comprises the steps of:

transforming each face to be displayed into a primitive selected from the group consisting of;

point, line and polygon; and

providing the primitives to a graphics engine.

3. A computer program product for identifying irregular volumes represented within volumetric input data, comprising a non-transitory computer-usable data medium carrying thereon a:

means for inputting one or more volume datasets comprising a multiplicity of three-dimensional cells;

means for establishing criteria describing properties of an irregular volume of interest;

means for processing each volume dataset, the processing comprising the steps of;

traversing from cell to cell of the volume dataset until a seed cell is identified having properties matching the criteria, the identified seed cell thereby belonging to an identified irregular volume;

identifying cells related to the seed cell by a predetermined relationship as belonging to the identified irregular volume; and

storing in a data structure associated with each identified cell belonging to the identified irregular volume attribute data describing properties of the identified cell;

means for selecting an identified irregular volume;

means for transforming each cell of the irregular volume that is selected into a polyhedral voxel representation, representation including a face string having a plurality of bits, and a position string having a plurality of bits, each bit of the face string corresponding to one face of the polyhedral voxel and having a value indicating whether the face is to be displayed, the position string having a value indicating a three-dimensional spatial position of the polyhedral voxel; and

means for rendering the representation of each polyhedral voxel, the face string for at least one polyhedral voxel representation having a bit with a value indicating at least one face is to be displayed for an internal cell.

4. The computer program product claimed in claim 3, wherein the means for rendering comprises a:

means for transforming each face to be displayed into a primitive selected from the group consisting of point, line and polygon; and

means for providing the primitives to a graphics engine.

5. A method for voxel-encoding a volume dataset comprising a multiplicity of cells, comprising the steps of:

defining a multiplicity of polyhedral voxels, each polyhedral voxel corresponding to one cell;

storing a representation of each polyhedral voxel, the representation including a face string having a plurality of bits, and a position string having a having a plurality of bits, each bit of the face string corresponding to one face of the polyhedral voxel and having a value indicating whether the face is to be displayed, the position string having a value indicating a three-dimensional spatial position of the polyhedral voxel; and

rendering the representation of each polyhedral voxel, the face string for at least one polyhedral voxel representation having a bit with a value indicating at least one face is to be displayed for an internal cell.

6. The method claimed in claim 5, wherein the step of rendering the representation of each polyhedral voxel comprises transforming each face or voxel to be displayed into a primitive selected from the group consisting of point, line and polygon.

7. The method claimed in claim 5, wherein the representation of each polyhedral voxel stored in a memory further includes a bit indicating whether the voxel is selected,

8. The method claimed in claim 5, wherein the representation of each polyhedral voxel stored in a memory further includes a normal string having a value indicating shading of each face to be displayed.

9. The method claimed in claim 5, wherein:

each polyhedral voxel is represented in a cube having six faces; and

each bit of the face string has a value indicating whether the face is to be displayed.

10. The method claimed in claim 9, further comprising:

the step of transforming each face to be displayed into a primitive by dividing each face into two triangles.

11. A computer program product for voxel-encoding a volume dataset comprising a multiplicity of cells, comprising a non-transitory computer-usable medium carrying thereon a:

means for defining a multiplicity of polyhedral voxels, each polyhedral voxel corresponding to one cell;

means for storing a representation of each polyhedral voxel, the representation including a face string having a plurality of bits, and a position string having a plurality of bits, each bit of the face string corresponding to one face of the polyhedral voxel and having a value indicating whether the face is to be displayed, the position string having a value indicating a three-dimensional spatial position of the polyhedral voxel; and

means for rendering the representation of each polyhedral voxel, the face string for at least one polyhedral voxel representation having a bit with a value indicating at least one face is to be displayed for an internal cell.

12. The computer program product claimed in claim 11, wherein the means for rendering the representation of each polyhedral voxel comprises a means for transforming each face to be displayed into a primitive selected from the group consisting of:

point, line and polygon.

13. The computer program product claimed in claim 11, wherein the representation of each polyhedral voxel stored in a computer memory further includes a bit indicating whether the voxel is selected.

14. The computer program product claimed in claim 11, wherein the representation of each polyhedral voxel stored in a computer memory further includes a normal string having a value indicating shading of each face to be displayed.

15. The computer program product claimed in claim 11, wherein:

each polyhedral voxel is represented as a cube having six faces; and

each bit of the face string has a value indicating whether the face is to be displayed.

16. The computer program product claimed in claim 15, further comprising a:

means for transforming each face to be displayed into a primitive by dividing each face into two triangles.