System and method for transparency rendering
View Patent ↗A system, method, and computer program product that accepts raw polygon geometry and view parameters from the visualization API, sorts the polygons in back-to-front order, and then supplies the sorted triangles to graphics API such as OpenGL.
1. A method for graphics processing, comprising:
receiving node and view data for a graphic object in a data processing system;
building a binary-space-partition tree corresponding to the graphic object, the binary-space-partition tree having up to a predetermined number of at least one shape associated with each leaf;
sorting shapes at each leaf of the binary-space-partition tree; and
outputting the sorted shapes from the data processing system.
2. The method of claim 1 , wherein the shapes are sorted into a substantially back-to-front order.
3. The method of claim 1 , further comprising caching the shape data.
4. The method of claim 1 , further comprising traversing the binary-space-partition tree.
5. The method of claim 1 , wherein the shapes are triangles.
6. The method of claim 1 , wherein a configuration component is used, the configuration component balancing the resolution of the binary-space-partition tree against the sorting shapes at each leaf.
7. The method of claim 3 , wherein a configuration component is used, the configuration component balancing resource usage against accuracy in the resolution of the caching.
8. A data processing system having at least a processor and accessible memory, comprising:
means for receiving node and view data for a graphic object;
means for building a binary-space-partition tree corresponding to the graphic object, the binary-space-partition tree having up to a predetermined number of at least one shape associated with each leaf;
means for sorting shapes at each leaf of the binary-space-partition tree; and
means for outputting the sorted shapes.
9. The data processing system of claim 8 , wherein the shapes are sorted into a substantially back-to-front order.
10. The data processing system of claim 8 , further comprising means for caching the shape data.
11. The data processing system of claim 8 , further comprising means for traversing the binary-space-partition tree.
12. The data processing system of claim 8 , wherein the shapes are triangles.
13. The data processing system of claim 8 , wherein a configuration component is used, the configuration component balancing the resolution of the binary-space-partition tree against the sorting shapes at each leaf.
14. The data processing system of claim 10 , wherein a configuration component is used, the configuration component balancing resource usage against accuracy in the resolution of the caching.
15. A computer program product tangibly embodied in a machine-readable medium, comprising:
instructions for receiving node and view data for a graphic object;
instructions for building a binary-space-partition tree corresponding to the graphic object, the binary-space-partition tree having up to a predetermined number of at least one shape associated with each leaf;
instructions for sorting shapes at each leaf of the binary-space-partition tree; and
instructions for outputting the sorted shapes.
16. The computer program product of claim 15 , wherein the shapes are sorted into a substantially back-to-front order.
17. The computer program product of claim 15 , further comprising instructions for caching the shape data.
18. The computer program product of claim 15 , further comprising instructions for traversing the binary-space-partition tree.
19. The computer program product of claim 15 , wherein the shapes are triangles.
20. The computer program product of claim 15 , wherein a configuration component is used, the configuration component balancing the resolution of the binary-space-partition tree against the sorting shapes at each leaf.
21. The computer program product of claim 17 , wherein a configuration component is used, the configuration component balancing resource usage against accuracy in the resolution of the caching.