• Iulian Grindeanu's avatar
    bsp test on 32 bit machine was too strict · a8269c6f
    Iulian Grindeanu authored
    we should consider for machine arithmetic at least the
    precision we used when the partitioning was built
    instead of failing when the point is "above" the plane when something is > 0,
    we should check if it is greater than EPSILON
BSPTreePoly.cpp 22.4 KB