Searched refs:nonneg_ray_len (Results 1 – 4 of 4) sorted by relevance
477 const double* nonneg_ray_len, in check_ray_limits() argument483 if(nonneg_ray_len) { // should be 0 <= t <= nonneg_ray_len in check_ray_limits()484 assert(0 <= *nonneg_ray_len); in check_ray_limits()517 const double* nonneg_ray_len, in intersect_ray() argument535 if (nonneg_ray_len) { in intersect_ray()536 assert(0<=*nonneg_ray_len); in intersect_ray()540 max_len = std::max(*nonneg_ray_len,-(*neg_ray_len)); in intersect_ray()542 max_len = *nonneg_ray_len; in intersect_ray()552 if(nonneg_ray_len) { in intersect_ray()553 if(*nonneg_ray_len>dist_s) return true; in intersect_ray()[all …]
611 double nonneg_ray_len = dist_limit; in ray_fire() local615 if(nonneg_ray_len < -neg_ray_len) nonneg_ray_len = -neg_ray_len; in ray_fire()616 if (0 > nonneg_ray_len || 0 <= neg_ray_len) { in ray_fire()630 OrientedBoxTreeTool::IntersectSearchWindow search_win(&nonneg_ray_len, &neg_ray_len); in ray_fire()
168 const double* nonneg_ray_len, in plucker_ray_tri_intersect() argument240 if((nonneg_ray_len && *nonneg_ray_len<dist) || // intersection is beyond positive limit in plucker_ray_tri_intersect()
878 const double nonneg_ray_len = 0.25; in test_plucker_ray_tri_intersect() local882 t, &nonneg_ray_len ); in test_plucker_ray_tri_intersect()