conner

03-04-2011, 08:31 AM

I have an application that needs to fill lots of simple 2D triangles.

I have a matrix of cells (pixels), and I need to increment the 16-bit cell value by a given amount for lots of triangles.

This can be done with OpenGL or other 3D graphics primitives, but the overhead of dealing with 3D seems excessive.

There are a number of triangle fill algorithms available, and it seems straight forward to code them into OpenCL.

My question is, are there hardware optimizations that will make populating 3D graphics structures and rendering using standard tools faster than anything that can be coded by hand for simple 2D?

Can someone point me to existing 2D libraries for OpenCL code?

I have a matrix of cells (pixels), and I need to increment the 16-bit cell value by a given amount for lots of triangles.

This can be done with OpenGL or other 3D graphics primitives, but the overhead of dealing with 3D seems excessive.

There are a number of triangle fill algorithms available, and it seems straight forward to code them into OpenCL.

My question is, are there hardware optimizations that will make populating 3D graphics structures and rendering using standard tools faster than anything that can be coded by hand for simple 2D?

Can someone point me to existing 2D libraries for OpenCL code?