Volume 9, Issue 3 Articles Tricks of the Trade In and Out Trott's Corner New Products New Publications Calendar News Bulletins New Resources Letters Classifieds Download This Issue Editorial Policy Staff and Contributors Submissions Subscriptions Advertising Back Issues Contact Information 
Algebraic Construction of Smooth Interpolants on Polygonal Domains
Input DataThe interpolant can be constructed on any twodimensional slice of any polytope, including polygons, polyhedra, or higherdimensional objects. Accordingly, the dimension of the data must be defined. The examples are in two dimensions.
The list of vertices must also be defined; for example, here is a triangle with three nodes.
Another example is a triangle enclosing a quadrilateral and an interior point.
For a simple interpolant, the quantity that is going to be distributed smoothly over the domain must be defined at every nodal point. The nodal points not only determine the structure of the domain, they are also the points at which the value being distributed is given. The vertices of the polygon are a subset of the nodal points. Nodal points and interpolation points are one and the same.


About Mathematica  Download Mathematica Player © Wolfram Media, Inc. All rights reserved. 