[Kazan]

the pof->cob code is imperfect, and most likely not in it's final version
it's just another one of those low priority things

[EdrickV]

Originally posted by Bobboau
I know, I have made a few models
but when converting from a pof to a cob the axes of the subobjects are centered at the center
I don't have any problems the other way around

Oops, misread the pof to cob as cob to pof.

[Fry_Day]

Kazan, I might nto remember my math right, but aren't the only cases that will really hurt a BSP tree building algorithm in cases where polygons are on the same plane or something? I don't see how any other cases could lead to problems with splitting correctly.

[Kazan]

Originally posted by Fry_Day
Kazan, I might nto remember my math right, but aren't the only cases that will really hurt a BSP tree building algorithm in cases where polygons are on the same plane or something? I don't see how any other cases could lead to problems with splitting correctly.

yes you remember correctly - but there's also the case in which two polygons have the same geometric center - because that's what my system uses to dtermine the polygon's "position"

[Fry_Day]

Oh. I see. Tell me, do you use any heuristics for trying to find the best BSP tree (Least amount of subdivisions), or do you simply split along the plane that creates the least subdivisions in each iteration?

[Kazan]

you split along the longest axis in the bounding box - you split fully until each terminating region has one polygon in it

this is a full tree and proides the greatest acceleration