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

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 interrogation.next 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 arithmetic.next 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 surfaces.next 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

Embedded Implicit Stand-ins for Animated Meshes: a Case of Hybrid Modelling

In this paper we address shape modelling problems, encountered in computer animation and computer games development that are difficult to solve just using polygonal meshes. Our approach is based on a hybrid modelling concept that combines polygonal meshes with implicit surfaces. A hybrid model consists of an animated polygonal mesh and an approximation of this mesh by a convolution surface stand-in that is embedded within it or is attached to it. The motions of both objects are synchronised using a rigging skeleton. This approach is used to model the interaction between an animated mesh object and a viscoelastic substance, normally modelled in implicit form. The adhesive behaviour of the viscous object is modelled using geometric blending operations on the corresponding implicit surfaces. Another application of this approach is the creation of metamorphosing implicit surface parts that are attached to an animated mesh. A prototype implementation of the proposed approach and several examples of modelling and animation with near real-time preview times are presented

Fast Reliable Ray-tracing of Procedurally Defined Implicit Surfaces Using Revised Affine Arithmetic

Fast and reliable rendering of implicit surfaces is an important area in the field of implicit modelling. Direct rendering, namely ray-tracing, is shown to be a suitable technique for obtaining good-quality visualisations of implicit surfaces. We present a technique for reliable ray-tracing of arbitrary procedurally defined implicit surfaces by using a modification of Affine Arithmetic called Revised Affine Arithmetic. A wide range of procedurally defined implicit objects can be rendered using this technique including polynomial surfaces, constructive solids, pseudo-random objects, procedurally defined microstructures, and others. We compare our technique with other reliable techniques based on Interval and Affine Arithmetic to show that our technique provides the fastest, while still reliable, ray-surface intersections and ray-tracing. We also suggest possible modifications for the GPU implementation of this technique for real-time rendering of relatively simple implicit models and for near real-time for complex implicit models

Fast Polygonization of Implicit Surfaces

ABSTRACT Our work is centered on the use of implicit surfaces in interactive applications (at least 10 frames per sec) running on high-end consumer architecture (modeling, simulation, deformable body animation, games). We focus on the Marching Cubes algorithm that we tried to implement in an optimized way. We restrict our work to blended iso-surfaces generated by skeletons, since this kind of implicit surfaces is the most handy to use for animations. Our implementation optimizations deal with the following features: simplifying the field function, accelerating its evaluation for each point (voxel-based technique), generating automatically the triangles for any case of the Marching Cubes. Another point we have considered concerns tesselation ambiguities often resulting in holes appearing in the surface. We have coded a library which is very easy to use and can be downloaded freely. All these optimizations allow us to sample implicit surfaces composed of 200 points in 45 ms on a 450 MHz Pentium II Xeon

Trimming implicit surfaces

ABSTRACT Algorithms of trimming implicit surfaces yielding surface sheets and stripes are presented. These twodimensional manifolds with boundaries result from set-theoretic operations on an implicit surface and a solid or another implicit surface. The algorithms generate adaptive polygonal approximation of the trimmed surfaces by extending our original implicit surface polygonization algorithm. The presented applications include modeling several spiral shaped surface sheets and stripes (after M. Escher's art works) and extraction of ridges on implicit surfaces. Another promising application of the presented algorithms is modeling heterogeneous objects as implicit complexes

Physically-Based Methods for Polygonization of Implicit Surfaces

We present discrete physically-based methods for generating polygonal approximations of implicit surfaces. These methods not only generate a combinatorial manifold approximating the surface, but also produce a structure that is well suited to numerical simulations in physically-based modeling and animation systems

Multi-scale space-variant FRep cellular structures

Existing mesh and voxel based modeling methods encounter difficulties when dealing with objects containing cellular structures on several scale levels and varying their parameters in space. We describe an alternative approach based on using real functions evaluated procedurally at any given point. This allows for modeling fully parameterized, nested and multi-scale cellular structures with dynamic variations in geometric and cellular properties. The geometry of a base unit cell is defined using Function Representation (FRep) based primitives and operations. The unit cell is then replicated in space using periodic space mappings such as sawtooth and triangle waves. While being replicated, the unit cell can vary its geometry and topology due to the use of dynamic parameterization. We illustrate this approach by several examples of microstructure generation within a given volume or along a given surface. We also outline some methods for direct rendering and fabrication not involving auxiliary mesh and voxel representations

Feature based volumes for implicit intersections.

The automatic generation of volumes bounding the intersection of two implicit surfaces (isosurfaces of real functions of 3D point coordinates) or feature based volumes (FBV) is presented. Such FBVs are defined by constructive operations, function normalization and offsetting. By applying various offset operations to the intersection of two surfaces, we can obtain variations in the shape of an FBV. The resulting volume can be used as a boundary for blending operations applied to two corresponding volumes, and also for visualization of feature curves and modeling of surface based structures including microstructures