if it’s trees does it have to be a billboard, would some “simpler” surfice ? crossing quads for example.

assuming it’s an editable mesh this gives the “exact” screen bounding box… fn GetScreenBounds obj = ( maxy = maxx = -99999999.0; miny = minx = 9…

the “likes recursion” wasn’t really a reference to performance but the way it (trees) lends its self to the coding

not even close i’m afraid… and the kdtree is also finding the median during the build… also the qkdtree seems to have a clean up issue

only twice as fast as what exactly ?

another issue with mxs and trees is trees like recursion and mxs doesn’t

this is the alternate version (in c++) if anyones interested struct OBB { Matrix3 tm; Point3 hsize; OBB() : tm(TRUE), hsize(0.0f,0.0f,0.0f) {}…

think SAT is your best bet the c++ example assumes the position is at the center of the box and half size is 0.5 *(len, width,height) could look som…

sorry my mistake

for me this place ranks alongside the half wit that thought moving max help online was a good idea, I fucking hate max’s online help with a vengance …

this is one way to do it, if you can guarantee the strings are already sorted you can forgo the qsort stage… ( key_string=”C:\Users\Admi…

convex bounding box for something like that is a non trivial exercise… you could try something like merge to single object, shell mod (for an offse…

have you tried… callbacks.broadcastCallback #preNodeUserPropChanged/#postNodeUserPropChanged it’s not a Node Event per se but may trigger something …

it’s seems to be related to elements with high matid and standard material or no material (an fx shader doesn’t have an issue) ( delete objects mob…

seems to be having a material id higher than 2048 that’s causing it