backend bbox bbox_subdividing bboxsize bboxTooBig bmat calcPartialVelocity calcPartialVelocity calcVelocityNonrational calcVelocityRational clampfactor clipbits cmat copy copyPt cullCheck cullCheck culling_method error_tolerance getNcoords getProperty getType hcoords identify inhcoords isBboxSubdividing isConstantSampling isCulling isDomainSampling isObjectSpaceParaSampling isObjectSpacePathSampling isParametricDistanceSampling isPathLengthSampling isProperty isRangeSampling isrational isRational isSampling isSurfaceAreaSampling Mapdesc Maplist mask maxDifference maxrate maxsrate maxtrate minsavings multmatrix4d ncoords next object_space_error_tolerance pixel_tolerance project project s_steps sampling_method setBboxsize setBmat setCmat setProperty setSmat smat subdivide subdivide sumPt surfbbox t_steps transform4d type xformAndCullCheck xformBounding xformBounding xformCulling xformCulling xformCulling xformMat xformMat xformNonrational xformRational xformSampling xformSampling xformSampling

int Mapdesc::bboxTooBig ( REAL *  p, int  rstride, int  cstride, int  nrows, int  ncols, REAL  bb[2][MAXCOORDS]  ) Definition at line 665 of file mapdesc.cc. Referenced by Patch::checkBboxConstraint(). { REAL bbpts[MAXORDER][MAXORDER][MAXCOORDS]; const int trstride = sizeof(bbpts[0]) / sizeof(REAL); const int tcstride = sizeof(bbpts[0][0]) / sizeof(REAL); // points have been transformed, therefore they are homogeneous // project points int val = project( p, rstride, cstride, &bbpts[0][0][0], trstride, tcstride, nrows, ncols ); if( val == 0 ) return -1; // compute bounding box bbox( bb, &bbpts[0][0][0], trstride, tcstride, nrows, ncols ); // find out if bounding box can't fit in unit cube if( bbox_subdividing == N_BBOXROUND ) { for( int k=0; k != inhcoords; k++ ) if( ceilf(bb[1][k]) - floorf(bb[0][k]) > bboxsize[k] ) return 1; } else { for( int k=0; k != inhcoords; k++ ) if( bb[1][k] - bb[0][k] > bboxsize[k] ) return 1; } return 0; }