fixed infinite recursion possibility in the path tracer

src/integrators/path/path.cpp

@@ -146,7 +146,7 @@ public:
 				/* Assuming that BSDF importance sampling is perfect,
 				   the following should equal the maximum albedo
 				   over all spectral samples */
-				Float approxAlbedo = std::min((Float) 1, bsdfVal.max());
+				Float approxAlbedo = std::min((Float) 0.9f, bsdfVal.max());
 				if (rRec.nextSample1D() > approxAlbedo)
 					break;
 				else

src/integrators/path/volpath.cpp

@@ -258,7 +258,7 @@ public:
 					/* Assuming that BSDF importance sampling is perfect,
 					   the following should equal the maximum albedo
 					   over all spectral samples */
-					Float approxAlbedo = std::min((Float) 1, bsdfVal.max());
+					Float approxAlbedo = std::min((Float) 0.9f, bsdfVal.max());
 					if (rRec.nextSample1D() > approxAlbedo)
 						break;
 					else

src/integrators/path/volpath_simple.cpp

@@ -193,7 +193,7 @@ public:
 					/* Assuming that BSDF importance sampling is perfect,
 					   the following should equal the maximum albedo
 					   over all spectral samples */
-					Float approxAlbedo = std::min((Float) 1, bsdfVal.max());
+					Float approxAlbedo = std::min((Float) 0.9, bsdfVal.max());
 					if (rRec.nextSample1D() > approxAlbedo)
 						break;
 					else