mahendragr

I have an array, whose size is 256.  This array has elements which are  in 0 to 1 range.  Now, i need an array whose size should be 65536, where  each element should be interpolated or scaled from the original array  of 256 values.  Some kind of mapping where, lets say, 10 values from the original image should match to more number values in the bigger array.  Is it doable?

Hi all,

I have a weird situation with kd-trees. I have implemented a kd-tree for volume rendering, which is also used for load balancing in a cluster-like environment. For example if there are two machines, each machine gets a part of the tree starting from the root and renders its portion. However, when i detect a load imbalance, i move the subdivision plane in the kdtree so that the machine which is slower gets less number of leaves(which contain the data), the problem now is, when i move the sub-division plane, i have two new bboxes, which are inturn divided again(which i dont want to happen as i save the old leaves based in its bbox and reuse them to prevent data reloading). My question is, how should i stop my tree from being subdivided again into smaller chunks, which are less than the leaf size

Hello all,

I'm a student studying in a university in germany, i'm about to start my thesis and thinking about volume rendering domain. Can one tell me where i can find the latest research topics on volume rendering?, my professor wants some ''new'' work in the field, i already proposed him a GPU cluster based volume rendering, but he isnt happy with that, so it would be really nice if somebody points me to new-latest topics in volume rendering,

Thanks and regards