public boolean testAab(float minX, float minY, float minZ, float maxX, float maxY, float maxZ) {
        /*
         * This is an implementation of the "2.4 Basic intersection test" of the mentioned site.
         * It does not distinguish between partially inside and fully inside, though, so the test with the 'p' vertex is omitted.
         */
        return nxX * (nxX < 0 ? minX : maxX) + nxY * (nxY < 0 ? minY : maxY) + nxZ * (nxZ < 0 ? minZ : maxZ) >= -nxW &&
               pxX * (pxX < 0 ? minX : maxX) + pxY * (pxY < 0 ? minY : maxY) + pxZ * (pxZ < 0 ? minZ : maxZ) >= -pxW &&
               nyX * (nyX < 0 ? minX : maxX) + nyY * (nyY < 0 ? minY : maxY) + nyZ * (nyZ < 0 ? minZ : maxZ) >= -nyW &&
               pyX * (pyX < 0 ? minX : maxX) + pyY * (pyY < 0 ? minY : maxY) + pyZ * (pyZ < 0 ? minZ : maxZ) >= -pyW &&
               nzX * (nzX < 0 ? minX : maxX) + nzY * (nzY < 0 ? minY : maxY) + nzZ * (nzZ < 0 ? minZ : maxZ) >= -nzW &&
               pzX * (pzX < 0 ? minX : maxX) + pzY * (pzY < 0 ? minY : maxY) + pzZ * (pzZ < 0 ? minZ : maxZ) >= -pzW;
    }
public boolean testAab ( float minX , float minY , float minZ , float maxX , float maxY , float maxZ ) { return nxX * ( nxX < 0 ? minX : maxX ) + nxY * ( nxY < 0 ? minY : maxY ) + nxZ * ( nxZ < 0 ? minZ : maxZ ) >= - nxW && pxX * ( pxX < 0 ? minX : maxX ) + pxY * ( pxY < 0 ? minY : maxY ) + pxZ * ( pxZ < 0 ? minZ : maxZ ) >= - pxW && nyX * ( nyX < 0 ? minX : maxX ) + nyY * ( nyY < 0 ? minY : maxY ) + nyZ * ( nyZ < 0 ? minZ : maxZ ) >= - nyW && pyX * ( pyX < 0 ? minX : maxX ) + pyY * ( pyY < 0 ? minY : maxY ) + pyZ * ( pyZ < 0 ? minZ : maxZ ) >= - pyW && nzX * ( nzX < 0 ? minX : maxX ) + nzY * ( nzY < 0 ? minY : maxY ) + nzZ * ( nzZ < 0 ? minZ : maxZ ) >= - nzW && pzX * ( pzX < 0 ? minX : maxX ) + pzY * ( pzY < 0 ? minY : maxY ) + pzZ * ( pzZ < 0 ? minZ : maxZ ) >= - pzW ; }
Test whether the given axis-aligned box is partly or completely within or outside of the frustum defined by <code>this</code> frustum culler.
The box is specified via its min and max corner coordinates.
<p>
The algorithm implemented by this method is conservative. This means that in certain circumstances a <i>false positive</i>
can occur, when the method returns <code>-1</code> for boxes that are actually not visible/do not intersect the frustum.
See <a href="http://iquilezles.org/www/articles/frustumcorrect/frustumcorrect.htm">iquilezles.org</a> for an examination of this problem.
<p>
Reference: <a href="http://old.cescg.org/CESCG-2002/DSykoraJJelinek/">Efficient View Frustum Culling</a>

@param minX
the x-coordinate of the minimum corner
@param minY
the y-coordinate of the minimum corner
@param minZ
the z-coordinate of the minimum corner
@param maxX
the x-coordinate of the maximum corner
@param maxY
the y-coordinate of the maximum corner
@param maxZ
the z-coordinate of the maximum corner
@return <code>true</code> if the axis-aligned box is completely or partly inside of the frustum; <code>false</code> otherwise