next up previous notation contents
Next: 4.3.4 Cut Heuristics Up: 4.3.1 Optimization: Super-Pixel Rendering Previous: 4.3.2 Constant Interval Arithmetic

4.3.3 Linear Interval Arithmetic

A similar algorithm may be enacted, but with linear interval arithmetic used to evaluate tex2html_wrap_inline37715 . The algorithm proceeds as before, unless

math27986

in which case the relationship between tex2html_wrap_inline37765 and the system parameters x and y may allow for some pixels to be set to either tex2html_wrap_inline32719 or tex2html_wrap_inline32721 . An example follows:

figure27995

The dotted lines indicate the constraints determined by the linear interval evaluation of S. Pixels which lie outside of these constraints are set to tex2html_wrap_inline32721 . A pixel tex2html_wrap_inline31435 may be set to tex2html_wrap_inline32719 if the evaluation of tex2html_wrap_inline38355 has shown that S is continuous over tex2html_wrap_inline31435 and that tex2html_wrap_inline38361 attains both signs. This is seen visually when the constraints divide the pixel into three regions; the constraint region includes no corners. Such determination mimics the one-dimensional case, described in section gif.

Pixel assignment may be rapidly performed by using provided graphics primitives. When

math28063

the appropriate rectangle is rendered; when

math27986

appropriate polygons are rendered. As demonstrated earlier, continuity information may also allow some pixels within the constraint region to be set when rendering equations. Usually, a white polygon on either side of the constraint region is rendered. With intimate knowledge of the provided graphics primitives, such rendering may be straightforward.

Slight perturbation of the polygon may ensure that pixels are not set incorrectly, as the following diagram suggests:

figure28079

The affected pixels are shown in dark grey; unaffected pixels are not shown.

Precise, rapid pixel control is posssible; a rapid polygon rendering may be followed by manipulation of the pixels along the perimeter of the polygon. A precise rendering of the graph may be deferred until the clusters describe small collections of pixels; polygon perturbation may ensure all intervening renderings still represent G.

Employing sophisticated interval arithmetics requires sophisticated graphics primitives; tex2html_wrap_inline38367 requires primitives which render conic sections. Unavailable graphics primitives may be implemented, but such implementation negates part of the advantage of using a more sophisticated interval arithmetic. When using sophisticated interval arithmetics, demotions may be used to reduce the variety of graphics primitives needed: tex2html_wrap_inline38369 allows tex2html_wrap_inline38367 to be used with polygon-filling primitives; tex2html_wrap_inline38373 and tex2html_wrap_inline38375 allow tex2html_wrap_inline33001 and tex2html_wrap_inline38367 to be used with rectangle-filling primitives.


next up previous notation contents
Next: 4.3.4 Cut Heuristics Up: 4.3.1 Optimization: Super-Pixel Rendering Previous: 4.3.2 Constant Interval Arithmetic
Jeff TupperMarch 1996