Challenging the Boundaries of Symbolic Computation 2003
DOI: 10.1142/9781848161313_0011
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic Construction of Smooth Interpolants on Polygonal Domains

Abstract: A smooth and bounded interpolant can be constructed in explicit algebraic form within any polygon, convex or concave. The resulting function is not unique and accordingly can be adjusted to satisfy desired global conditions, such as linear fields. The closed-form representation is obtained by combining simple geometric descriptions, such as the side lengths and areas. The interpolant distributes values given at discrete nodes smoothly over the interior of the domain. On a convex polygon, the interpolant is a r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 7 publications
0
6
0
Order By: Relevance
“…Note the poles on the outside of the convex polygon on the left as well as along the extensions of the two top edges of the non-convex polygon on the right. More recently, several papers, [Floater 1997;Floater 1998;Floater 2003], [Malsch and Dasgupta 2003] and [Hormann 2004], have focused on building interpolants for non-convex 2D polygons. In particular, Floater proposed a new type of interpolant based on the mean value theorem [Floater 2003] that generates smooth coordinates for star-shaped polygons.…”
Section: Introductionmentioning
confidence: 99%
“…Note the poles on the outside of the convex polygon on the left as well as along the extensions of the two top edges of the non-convex polygon on the right. More recently, several papers, [Floater 1997;Floater 1998;Floater 2003], [Malsch and Dasgupta 2003] and [Hormann 2004], have focused on building interpolants for non-convex 2D polygons. In particular, Floater proposed a new type of interpolant based on the mean value theorem [Floater 2003] that generates smooth coordinates for star-shaped polygons.…”
Section: Introductionmentioning
confidence: 99%
“…However, the main limitation of Wachspress's method is the restriction to convex shapes. [MD04] replaced the area function with a positive edge‐length based function for concave polygons, and [DW08b] provided an extension to concave shapes as well.…”
Section: Related Workmentioning
confidence: 99%
“…Several papers, [51,66,67,68,69], have focused on building interpolants for nonconvex 2D polygons. In particular, Floater proposed a new type of interpolant based on the "Mean Value Theorem" that generates smooth coordinates for star-shaped polygons.…”
Section: Cage Definitionmentioning
confidence: 99%