1973
DOI: 10.1016/0021-9045(73)90020-8
|View full text |Cite
|
Sign up to set email alerts
|

Smooth interpolation in triangles

Abstract: Boolean sum smooth interpolation to boundary data on a triangle is described. Sufficient conditions are given so that the functions when pieced together form a C N-1 (Ω) function over a triangular subdivision of a polygonal region Ω and the precision sets of the interpolation functions are derived. The interpolants are modified so that the compatability conditions on the function which is interpolated can be removed and a C 1 interpolant is used to illustrate the theory. The generation of interpolation schemes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
45
0
1

Year Published

1983
1983
2018
2018

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 182 publications
(46 citation statements)
references
References 6 publications
0
45
0
1
Order By: Relevance
“…Gordon, there have been constructed interpolation operators of Lagrange, Hermite and Birkhoff type, that interpolate the values of a given function or the values of the function and of certain of its derivatives on the boundary of a triangle with straight sides. These operators were applied in computer aided geometric design (see, e.g., [1]- [3], [5]]) and in finite element analysis (see, e.g., [1], [7], [8], [13], [17]- [19], [21], [22]). …”
Section: Related Reviewsmentioning
confidence: 99%
“…Gordon, there have been constructed interpolation operators of Lagrange, Hermite and Birkhoff type, that interpolate the values of a given function or the values of the function and of certain of its derivatives on the boundary of a triangle with straight sides. These operators were applied in computer aided geometric design (see, e.g., [1]- [3], [5]]) and in finite element analysis (see, e.g., [1], [7], [8], [13], [17]- [19], [21], [22]). …”
Section: Related Reviewsmentioning
confidence: 99%
“…Smoother interpolants over triangulations will typically fail to remain within the bounds of the data, but several have been modified to incorporate constraints. For example, Asim [Asi00] modifies the Barnhill et al [BBG73] blending method (constrained cubics as suggested by Asim and Brodlie [AB03] are created along triangle edges and blended in the interior); Ong and Wong [OW96] create a C 1 interpolant by blending constrained rational cubics along triangle edges using the Nielson [Nie79] side-vertex method. Mulansky and Schmidt [MS94] construct a constrained C 1 interpolant using quadratic splines on a Powell-Sabin refinement of the original triangulation.…”
Section: Introductionmentioning
confidence: 99%
“…This paper gives a method of constructing triangular patches by C-curves. The first smooth interpolation triangular patch to boundary curves of a triangle was proposed by Barnhill, Birkhoff and Gordon (7) . The triangular patch is constructed using the Boolean sum scheme.…”
Section: Introductionmentioning
confidence: 99%