Irrlicht Engine

very like it. I rarely say that

if you want the new features you should go for clang. It compiles in no time, and provide very usefull warnings and errors thanks to VLLM.
unluckily is still hard getting a working installation of clang on windows but i've seen few tutorials recently. oh and it is compatible with GCC

I think that every italian should listen to your opinions, unluckily we here still belevie to only 1 media source, despite the disaster Berlusconi caused in italy, he was still able to get 25% of the votes. Media are all against the only political force that can beat Berlusconi (it's the first time ...

thanks, very nice article I add to favourites now

O_O astonishing game

In particular wich are your opinions about:

-Italy medias
-Silvio Berlusconi
-Beppe Grillo
-Italian politics

I ask here because I really can't rely on local newspapers:/
one newspaper say a thing and the other one say the opposite. What should know a Italian from people living in other countries?

use parallax grass drawed on cubes. or just drawed above the terrain offsetted again from ground level.
You *JUST* need a different texture for each triangle of the offsetted terrain, but result will be real-looking.

aaammmsterdddam wrote:Wait irrlicht is incompatible with gcc 4.7.x? (But it worked for me, 0 errors 2 warnings (linux - accurate math - shared object) *confused*)

enable
compiler flag

no one have some In Topic timings ^^ ?

Why no one make a irrlicht game-example using the above CuteAlien's suggestion?

A lot can be learned from his suggestions^^

Nice, strange no one still answered . some times ago I rember there was TONS of people asking for such embedding.

use recursive quatree. instead of having each node divided into 4 pieces you divide it in more (9/16 etc.) theorically should be faster even if it keeps O(logN) execution time. EDIT: or better just use a grid. you check nearby quads etc. and only accurate check for quads on corners of your range

isn't physix limited to a object count of 65536 items? havin separated voxels can be quite limiting

that's not hotpath. code is runned as benchmark and so, is a benchmark, the sense it makes is to measure "new" time. and since is made for that every other usage is of course senseless.. anyway I have 2.3 ghz cpu (AMD opteron)

how much times takes to you to execute this code? (both debug and release optimized)   class Test{ // empty class   };   for(int i=0;i<10000000; i++) //ten millions allocations     {         Test * a = new Test;         delete a;     }       return 0;   on debug it required 4.22 seconds (roughly 39....