next up previous notation contents
Next: 4.4 Optimization: Caching Up: 4.3.1 Optimization: Super-Pixel Rendering Previous: 4.3.4 Cut Heuristics

4.3.5 Examples of Cutting Heuristics

Many cutting heuristics are possible. The presented super-pixel renderings cut each pixel cluster into four equal pieces.

figure28300

Another possibility is to consider the consraint region, and to cut each pixel cluster into two equal pieces, cutting across the longer side of the region.

figure28321

After cutting is performed, the domain may be constricted to tightly bound the constrained region.

figure28342

The regions exluded by such constriction are already determined exactly. The following figure illustrates

math28385

being rendered over the region tex2html_wrap_inline38409 , with each column representing a different cutting heuristics. As each heuristic requires a different number of interval evaluations per stage, one should not compare the different techniques based on the following figure.

figure28389

The following diagram illustrates the gains possible using the different cutting heuristics.

figure28425

The diagram illustrates the area contained within the constrained regions while rendering

math28385

over the region tex2html_wrap_inline38409 using linear interval arithmetic with various cutting heuristics. Data from a rendering using constant interval arithmetic is also included, for reference.


next up previous notation contents
Next: 4.4 Optimization: Caching Up: 4.3.1 Optimization: Super-Pixel Rendering Previous: 4.3.4 Cut Heuristics
Jeff TupperMarch 1996