2005
DOI: 10.1080/2151237x.2005.10129192
|View full text |Cite
|
Sign up to set email alerts
|

Smooth Two-Dimensional Interpolations: A Recipe for All Polygons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(26 citation statements)
references
References 12 publications
0
26
0
Order By: Relevance
“…The interpolant is a function of Lebesgue measure of Voronoi edge and L 2 distance norm Mean value coordinates [12,13] Yes Interpolant is a function of geometric quantities -L 2 distance norm and area Metric coordinate method [14] Yes Uses measures such as edge length, signed area of triangle, and trigonometric functions of sine and cosine to construct the shape functions Maximum entropy [15][16][17] Yes Shape functions and their derivatives are obtained by maximizing the Shannon's entropy function under prescribed boundary conditions Harmonic coordinates [20][21][22] Yes Shape functions and their derivatives are obtained by solving the Laplace equation hierarchically a b which is computationally expensive. Moreover, to achieve accurate results, a high order numerical quadrature is required.…”
Section: Interpolantsmentioning
confidence: 99%
See 1 more Smart Citation
“…The interpolant is a function of Lebesgue measure of Voronoi edge and L 2 distance norm Mean value coordinates [12,13] Yes Interpolant is a function of geometric quantities -L 2 distance norm and area Metric coordinate method [14] Yes Uses measures such as edge length, signed area of triangle, and trigonometric functions of sine and cosine to construct the shape functions Maximum entropy [15][16][17] Yes Shape functions and their derivatives are obtained by maximizing the Shannon's entropy function under prescribed boundary conditions Harmonic coordinates [20][21][22] Yes Shape functions and their derivatives are obtained by solving the Laplace equation hierarchically a b which is computationally expensive. Moreover, to achieve accurate results, a high order numerical quadrature is required.…”
Section: Interpolantsmentioning
confidence: 99%
“…Based on the kinematic decomposition of deformation state (14) and the energy orthogonality property (12), the continuous bilinear form can be written as:…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…An alternative approach to derive the polygonal interpolants was proposed by Malsch et al (2005) by employing the metric coordinate system that can be used in convex or concave polygons, or any polygonal domain containing isolated points in its interior. The resulting shape functions are defined at any point of the polygon that satisfy the boundedness, completeness and linearity on each side.…”
Section: Metric Coordinatesmentioning
confidence: 99%
“…5). These properties are not met by other barycentric constructions [13,16]. Hormann and Floater [15] have presented the important properties of mean value coordinates along with an implementation for planar polygons.…”
Section: Polygonal Meshesmentioning
confidence: 99%
“…Many new contributions on barycentric polygonal interpolation have been realized in geometry modeling and graphics, and in finite element methods [1,[9][10][11][12][13][14][15][16]. In Reference [1], natural neighbor based (Laplace) interpolants [17] are used to construct shape functions on irregular polygons (n-gons), which is adapted to quadtree meshes (resolves the issue of hanging nodes) in References [18,19].…”
Section: Introductionmentioning
confidence: 99%