Caustics - simple questions
Members - Reputation: 259
Posted 03 December 2012 - 08:33 AM
When discussing caustics, what exactly are caustic volumes and caustic triangles?
Caustics is the effect of light being bent by a surface and then somehow being absorbed by another surface. If we talk water volumes (like an ocean), is the caustic volume the full water volume, and the triangle some arbitrary triangle at the floor? Cause I'm really confused about the terminology!
Members - Reputation: 259
Posted 03 December 2012 - 09:06 AM
Members - Reputation: 637
Posted 03 December 2012 - 09:11 AM
Crossbones+ - Reputation: 9100
Posted 03 December 2012 - 07:14 PM
That's not true. There are different types of caustics. In a water volume, caustics at the bottom of say, a river, come from (in order of importance):
Caustics is the effect of light being bent by a surface and then somehow being absorbed by another surface.
- refractive caustics, caused by light being focused by refraction upon entering the water volume
- reflective caustics, which happens when light inside the water volume tries to escape the water but reflects back into it instead
- scattering caustics, in which light gets scattered inside the volume due to local changes in density
Here, only refractive caustics are being considered (as they are the most important, the easiest to represent, and the simplest to calculate). In the PDF, yes, the caustic triangle is the triangle upon which incident light refracting through the specular triangle falls, and the caustic volume is the volume subtended between those two triangles (see figure 2) as Luca says. It seems they assume incident light is directional, which makes sense if you consider sufficiently small triangles.
Edited by Bacterius, 03 December 2012 - 07:15 PM.
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis