PjotrSvetachov

Members
  • Content count

    6
  • Joined

  • Last visited

Community Reputation

622 Good

About PjotrSvetachov

  • Rank
    Newbie
  1. Last year at Siggraph Asia there was a cool paper on presorted triangle lists: http://w3.impa.br/~diego/publications/ChenEtAl12.pdf I haven't tried to implement it but it looks cool. It uses some prepossessing to make a special triangle list with the triangles in a special order that can be rendered in any view. Of course this order does not always exist so what they do is duplicate some triangles.Then they use a simple test in the one of the shader stages to skip some of the duplicated triangles. The test can be done in either the geometry, vertex or fragment stage in the paper they explain the pro and cons of each stage.
  2. How Much do You Plan to Support Windows 8/Metro?

    Microsoft is hosting it's Build 2012 conference right now and you can watch it live or watch past sessions here: [url="http://channel9.msdn.com/"]http://channel9.msdn.com/[/url] I have heard them confirm more than once that if you use your own payment system you don't pay any fees. One in the keynote speach Ballmer gave and later in the talk "Windows store: how does it work" Just select day 1 then scroll down to select those sessions to see it for your self. They showed an example (don't remember where, I think it was in one of the keynote talks) where you could select between Microsoft store and paypal payment when buying an application from the store. This probably means you don't need to make the application free first and then later chage in the app to cut Microsoft out. You can probably charge them already when they buying you app from the store which would be good news. But like Olof said for small companies it might be a lot easier to just use the Microsoft store system. What you actually paying Microsoft for using their commerce system and API and let them handle the payment and not for your app being in the store.
  3. The node structure is stored in linear memory. The bricks are stored in the 3D texture but there are pointers in the node stucture that tell you where the bricks are. So the brick belonging to the first node could be at (1,1,1) but the brick belonging to the second node could be at (36,4,13). Of course it's not likely but this can be done. As for other information like normals, I'm not sure but I believe this is stored in a seperate 3D texture using the same brick layout. This way you only need to have one pointer to acces all the information.
  4. In section 4.1 in this paper of him: http://maverick.inria.fr/Publications/2011/CNSGE11b/GIVoxels-pg2011-authors.pdf he says that in each node there is a pointer to a brick which makes me believe the bricks are stored in a compact way in the 3d texture and there is no correlation to brick position and world space position of the voxels.
  5. Which paper did you read? I remember that I read in the original paper for giga voxel they used larger bricks which they ray traced through using multiple texture lookups. But that was for volume data that is not always sparse. In that paper they used a constant color at the nodes only if the whole brick had a constant color so they could skip the ray tracing step. In the global illumination paper they don't seem to store a constant color at the nodes, they only use the bricks. This is also because bricks are always 2x2x2 and only require one lookup (well actually the bricks are 3x3x3 because you need a extra border for the interpolation to work). Yes it seems that you will have bricks that partially lie in empty space. I assume they set the alpha for those bricks to zero so when doing the interpolated lookup they would have smooth transitions and thus less aliasing.
  6. The guys from Unreal Engine have just released the slides from the talk they did on Siggraph: http://www.unrealengine.com/resources/ 1/3 of the slides are about cone how they do cone tracing. They say they are using the method in the paper with a few optimizations.