• Advertisement
  • Popular Tags

  • Popular Now

  • Advertisement
  • Similar Content

    • By Jiraya
      For a 2D game, does using a float2 for position increases performance in any way?
      I know that in the end the vertex shader will have to return a float4 anyway, but does using a float2 decreases the amount of data that will have to be sent from the CPU to the GPU?
       
    • By ucfchuck
      I am feeding in 16 bit unsigned integer data to process in a compute shader and i need to get a standard deviation.
      So I read in a series of samples and push them into float arrays
      float vals1[9], vals2[9], vals3[9], vals4[9]; int x = 0,y=0; for ( x = 0; x < 3; x++) { for (y = 0; y < 3; y++) { vals1[3 * x + y] = (float) (asuint(Input1[threadID.xy + int2(x - 1, y - 1)].x)); vals2[3 * x + y] = (float) (asuint(Input2[threadID.xy + int2(x - 1, y - 1)].x)); vals3[3 * x + y] = (float) (asuint(Input3[threadID.xy + int2(x - 1, y - 1)].x)); vals4[3 * x + y] = (float) (asuint(Input4[threadID.xy + int2(x - 1, y - 1)].x)); } } I can send these values out directly and the data is as expected

                             
      Output1[threadID.xy] = (uint) (vals1[4] ); Output2[threadID.xy] = (uint) (vals2[4] ); Output3[threadID.xy] = (uint) (vals3[4] ); Output4[threadID.xy] = (uint) (vals4[4] ); however if i do anything to that data it is destroyed.
      If i add a
      vals1[4] = vals1[4]/2; 
      or a
      vals1[4] = vals[1]-vals[4];
      the data is gone and everything comes back 0.
       
       
      How does one go about converting a uint to a float and performing operations on it and then converting back to a rounded uint?
    • By fs1
      I have been trying to see how the ID3DInclude, and how its methods Open and Close work.
      I would like to add a custom path for the D3DCompile function to search for some of my includes.
      I have not found any working example. Could someone point me on how to implement these functions? I would like D3DCompile to look at a custom C:\Folder path for some of the include files.
      Thanks
    • By stale
      I'm continuing to learn more about terrain rendering, and so far I've managed to load in a heightmap and render it as a tessellated wireframe (following Frank Luna's DX11 book). However, I'm getting some really weird behavior where a large section of the wireframe is being rendered with a yellow color, even though my pixel shader is hard coded to output white. 

      The parts of the mesh that are discolored changes as well, as pictured below (mesh is being clipped by far plane).

      Here is my pixel shader. As mentioned, I simply hard code it to output white:
      float PS(DOUT pin) : SV_Target { return float4(1.0f, 1.0f, 1.0f, 1.0f); } I'm completely lost on what could be causing this, so any help in the right direction would be greatly appreciated. If I can help by providing more information please let me know.
    • By evelyn4you
      Hello,
      i try to implement voxel cone tracing in my game engine.
      I have read many publications about this, but some crucial portions are still not clear to me.
      At first step i try to emplement the easiest "poor mans" method
      a.  my test scene "Sponza Atrium" is voxelized completetly in a static voxel grid 128^3 ( structured buffer contains albedo)
      b. i dont care about "conservative rasterization" and dont use any sparse voxel access structure
      c. every voxel does have the same color for every side ( top, bottom, front .. )
      d.  one directional light injects light to the voxels ( another stuctured buffer )
      I will try to say what i think is correct ( please correct me )
      GI lighting a given vertecie  in a ideal method
      A.  we would shoot many ( e.g. 1000 ) rays in the half hemisphere which is oriented according to the normal of that vertecie
      B.  we would take into account every occluder ( which is very much work load) and sample the color from the hit point.
      C. according to the angle between ray and the vertecie normal we would weigth ( cosin ) the color and sum up all samples and devide by the count of rays
      Voxel GI lighting
      In priciple we want to do the same thing with our voxel structure.
      Even if we would know where the correct hit points of the vertecie are we would have the task to calculate the weighted sum of many voxels.
      Saving time for weighted summing up of colors of each voxel
      To save the time for weighted summing up of colors of each voxel we build bricks or clusters.
      Every 8 neigbour voxels make a "cluster voxel" of level 1, ( this is done recursively for many levels ).
      The color of a side of a "cluster voxel" is the average of the colors of the four containing voxels sides with the same orientation.

      After having done this we can sample the far away parts just by sampling the coresponding "cluster voxel with the coresponding level" and get the summed up color.
      Actually this process is done be mip mapping a texture that contains the colors of the voxels which places the color of the neighbouring voxels also near by in the texture.
      Cone tracing, howto ??
      Here my understanding is confus ?? How is the voxel structure efficiently traced.
      I simply cannot understand how the occlusion problem is fastly solved so that we know which single voxel or "cluster voxel" of which level we have to sample.
      Supposed,  i am in a dark room that is filled with many boxes of different kind of sizes an i have a pocket lamp e.g. with a pyramid formed light cone
      - i would see some single voxels near or far
      - i would also see many different kind of boxes "clustered voxels" of different sizes which are partly occluded
      How do i make a weighted sum of this ligting area ??
      e.g. if i want to sample a "clustered voxel level 4" i have to take into account how much per cent of the area of this "clustered voxel" is occluded.
      Please be patient with me, i really try to understand but maybe i need some more explanation than others
      best regards evelyn
       
       
  • Advertisement
  • Advertisement
Sign in to follow this  

DX11 volume rendering

This topic is 501 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi,

I have a medical volume data and I would like to learn how to write a HLSL shader to do ray-cast rendering, volume slicing etc.

Can anybody provide me some links for this kind of examples?

 

I use DX11.

 

Thanks a lot.

 

YL

 

Share this post


Link to post
Share on other sites
Advertisement

This page talks about it in terms of OpenGL. http://prideout.net/blog/?p=64

 

You can surely spend 30 minutes figuring out how to translate it, I think there are even HLSL to GLSL (and vice-versa) converters out there as they are really just exposing the underlying hardware functions.

 

The whole point is that you load your volume into a 3D texture and then render a cube/rectangular prism where each vertex is given its corresponding texture coordinate for the volume. Then, in a fragment/pixel shader you receive the interpolated texture coordinate for the fragments of the surface of the geometry and that serves as the origin for each raycast insofar as the math is concerned. What you need to do next is figure the vector through texture space that represents the direction the ray much march through the texture along the line that travels from the camera through the volume's geometry. In some instances this is accomplished via a complicated manner where both the front and back faces of the volume geometry are rendered to generate the starting and ending points for each fragment's ray through the texture. I just use the modelview matrix to directly calculate a perfectly acceptable ray vector, which is just the normalized vector between the viewpoint and the fragment. The math is a little tricky to visualize, but if you think about it it's just one step beyond multiplying your modelview matrix against the vertex position, and then multiply that against your modelview matrix again to orient it in worldspace.

 

 In my vertex shader it's as simple as multiplying the modelview matrix with the vertex position to get the final render position for the vertex, and then multiply that against the modelview matrix to effectively perform an inverse matrix transform. Normalize that and you have the vector.

 

 I made a really simple GL program that does this exactly a while ago. I'll go see if I can dig that up. Even though it's in OpenGL/GLSL I'm sure it won't be hard to port to HLSL.

Share this post


Link to post
Share on other sites

I was hired to do this in 2005 with CT data. A cheap easy way is to load the volume data into a 3D/volume texture, then draw a series of camera-aligned quads (billboards) with alpha blending and sample the volume texture from your world vertex coords. This is nice because it's very quick and easy to implement and intuitive. If you're feeling clever, you can simply raytrace the data in the shader by drawing rays and subdividing, which is a simple extension once you have the aligned quads. The math is pretty similar to any shader raytrace, parallax mapping might be a good reference for how to do that in general. Computing rays from the camera is a simple unproject operation - calculate clip space XY position for the fragment, multiply using two different Z values by inverse viewproj and you get a ray. Or you can compute the frustum corners and interpolate if you prefer that approach.

Edited by Promit

Share this post


Link to post
Share on other sites

I was hired to do this in 2005 with CT data. A cheap easy way is to load the volume data into a 3D/volume texture, then draw a series of camera-aligned quads (billboards) with alpha blending and sample the volume texture from your world vertex coords. This is nice because it's very quick and easy to implement and intuitive. If you're feeling clever, you can simply raytrace the data in the shader by drawing rays and subdividing, which is a simple extension once you have the aligned quads. The math is pretty similar to any shader raytrace, parallax mapping might be a good reference for how to do that in general. Computing rays from the camera is a simple unproject operation - calculate clip space XY position for the fragment, multiply using two different Z values by inverse viewproj and you get a ray. Or you can compute the frustum corners and interpolate if you prefer that approach.

 

This was something I did as well before but without any vertex/fragment shaders, just using fixed-function OpenGL. I just drew a static set of quads on the screen with an orthographic projection. They don't need to actually be floating in space. Then for each one I generated texture coordinates based on the camera's position, orientation, and FOV, for each of the quads, and just let it fill the screen with its slice of the volume 3D texture. This works a lot better if you want to actually be inside of the volume, whereas the other method that raymarches from the outer surface of the bounding volume requires that the camera is external to the volume data.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement