Fast reliable interrogation of procedurally defined implicit surfaces using extended revised affine arithmetic.

This source preferred by Peter Comninos, Oleg Fryazinov and Alexander Pasko

Authors: Fryazinov, O., Pasko, A. and Comninos, P.

Journal: Computers and Graphics

Volume: 34

Pages: 708-718

ISSN: 0097-8493

DOI: 10.1016/j.cag.2010.07.003

Techniques based on interval and previous termaffine arithmetic next term and their modifications are shown to provide previous term reliable next term function range evaluation for the purposes of previous termsurface term In this paper we present a technique for the previous termreliable interrogation of implicit surfacesnext term using a modification of previous termaffine arithmeticnext term called previous term revised affine term We extend the range of functions presented in previous termrevised affine arithmeticnext term by introducing previous termaffinenext term operations for arbitrary functions such as set-theoretic operations with R-functions, blending and conditional operators. The obtained previous termaffinenext term forms of arbitrary functions provide previous termfasternext term and tighter function range evaluation. Several case studies for operations using previous termaffinenext term forms are presented. The proposed techniques for previous termsurface interrogationnext term are tested using ray-previous termsurfacenext term intersection for ray-tracing and spatial cell enumeration for polygonisation. These applications with our extensions provide previous termfast and reliablenext term rendering of a wide range of arbitrary previous termprocedurally defined implicit surfacesnext term (including polynomial previous termsurfaces,next term constructive solids, pseudo-random objects, previous termprocedurally definednext term microstructures, and others). We compare the function range evaluation technique based on previous termextended revised affine arithmeticnext term with other previous termreliablenext term techniques based on interval and previous termaffine arithmeticnext term to show that our technique provides the previous termfastestnext term and tightest function range evaluation for previous termfast and reliable interrogation of procedurally defined implicit term Research Highlights

The main contributions of this paper are as follows. ► The widening of the scope of previous termreliablenext term ray-tracing and spatial enumeration algorithms for previous termsurfacesnext term ranging from algebraic previous termsurfaces (definednext term by polynomials) to general previous termimplicit surfaces (definednext term by function evaluation procedures involving both previous termaffinenext term and non-previous termaffinenext term operations based on previous termrevised affine arithmetic)next term. ► The introduction of a technique for representing procedural models using special previous termaffinenext term forms (illustrated by case studies of previous termaffinenext term forms for set-theoretic operations in the form of R-functions, blending operations and conditional operations). ► The detailed derivation of special previous termaffinenext term forms for arbitrary operators.

The data on this page was last updated at 04:55 on June 23, 2018.