Jump to content

  • Log In with Google      Sign In   
  • Create Account

french_hustler

Member Since 06 Sep 2004
Offline Last Active Dec 11 2014 06:57 PM

Posts I've Made

In Topic: Tiled Resources & Large RWByteAddressBuffers

05 September 2014 - 10:32 AM

I haven't used tiled resources yet, but I think you have to perform calculations that depend on the tiled resources' address mapping model on the CPU, and send the results to your shader, treating them as relative to the start of the region of active tiles. Also, I think that the RWByteAddressBuffer you access in your shader is not actually the whole buffer, but only the active tiles, so the RWByteAddressBuffer's address 0 actually corresponds to the tiled resource's pDestTileRegionStartCoordinate value set with ID3D11DeviceContext2::UpdateTiles, and RWByteAddressBuffer::GetDimensions returns only the size of the active tiles...

 

Also, there's no such thing as a negative uint. smile.png

 

Hey thanks for the reply. You're right about uints not being negative... that was silly of me. I wrote that because I was storing the values and reading them back on the CPU as integers. Regardless though, the returned values are incorrect once the tiled resource RWByteAddressBuffer is larger than what can be addressed with a 32bit uint.

With tiled resources though, indexing into buffers remains the same. If you hit a sparse area though, the behavior will differ depending on the "tier level": supported by your GPU. In my case, I map a single "dummy" physical tile to any sparse tile of the buffer. Though inefficient, any time a store occurs to a sparse area, it will map to the dummy tile.

 

I'm pretty sure the code is correct since I tested the kernel on a smaller buffer. The problem is that the API allows you to create really huge tiled resources (since memory isn't allocated until you actually use UpdateTiles(...)), but doesn't let you access areas of byte addressable buffers that are beyond 2^32 bytes. The only solution I currently see is to either bind multiple buffers to the kernel and implement some sort of logic that would spill over to the next buffer once you reach areas that are addressable or rethink my algorithm as a whole :(.


In Topic: Run DirectX 11 stream output without drawing

07 June 2014 - 04:03 PM

Hey unbird, thanks for your reply.

 

 

Edit: Is this for vanilla DX11 ? Because 11.1 allows writing to UAVs from every shader stage. You wouldn't even need stream out functionality.
 

 

You know, I recently bought a GTX 770 card that claims to support 11.2.  Scattered RW from any stage was one feature I really wanted on my new GPU.  Turns out NVIDIA does not support the full feature set. I do find it a bit misleading when the specifications fail to mention that it isn't a full support but "capable" of the 11.2 feature set.


In Topic: Run DirectX 11 stream output without drawing

06 June 2014 - 04:17 PM

I have a further question about SO. 

I was going to post a new topic but since this thread is "sort of" similar, I might as well ask here.

 

I basically want to voxelize my geometry. I was trying to by-pass the rasterization pipeline to do so as to avoid doing conservative rasterization by using the geometry shader. Instead I take all my objects vertices and indices, and for each object create an associated buffer of triangles.  I pass all these buffers into a kernel that creates my voxel grid datastructure.

 

Instead of pre-creating these buffers with triangles, I was thinking of rendering my scene regularly but streaming-out these triangles using an SO resource. What do I need to do to be able to use this resource in a compute kernel? Also is there a way to know how many elements are in an SO buffer?

 

Thank you.


In Topic: Frustum culling using a KD-tree

14 June 2013 - 03:04 PM

Makes more sense... Thank you Bacterius.


In Topic: Frustum culling using a KD-tree

10 June 2013 - 11:03 AM

Hey, thanks for the reply.  I am still confused angry.png .

 

Say I build the kd-tree from scratch.  I have N entities each with their own AABB bound.  Would I construct the kd-tree using the position of the entities?  Or should each point of the bounding boxes be used?  To me, a BVH makes much more sense for frustum culling as the nodes represent an AABB.  Same goes for structures like octrees for example.  Each node represents an "area" in space.  With a kd-tree a node represents a split in one dimension.


PARTNERS