Thanks for the number, but I was asking more for comparison to the current subdivision scheme: ie how fast renders a triangle subdivided 50 times with the current subidivision code and displaced and how fast renders the same triangle dynamically subdivided and displaced. This is the really significant metric. A single triangle will obviously be faster to render than millions of triangles
ot but isn't subdivision by loop algo different then with catmull-clark algorithm? catmull-clark doesn't preserve edges either (as implemented in blender.. only simple subdiv preserve them)
edit: oh I misunderstud comment..
Last edited by psychotron on Wed Jan 06, 2010 3:40 pm, edited 1 time in total.
When you're done, it'll be able to fully replace the heightfield primitive. That's a nice fallout I think. And while you're at it, don't forget to implement proper NURBS and strands and ...